| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Substitution of equality into both sides of a subclass relationship. |
| Ref | Expression |
|---|---|
| 3sstr3d.1 |
|
| 3sstr3d.2 |
|
| 3sstr3d.3 |
|
| Ref | Expression |
|---|---|
| 3sstr3d |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3sstr3d.1 |
. 2
| |
| 2 | 3sstr3d.2 |
. . 3
| |
| 3 | 3sstr3d.3 |
. . 3
| |
| 4 | 2, 3 | sseq12d 2101 |
. 2
|
| 5 | 1, 4 | mpbid 195 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: shlej2 9380 pjspansn 9524 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 966 ax-gen 967 ax-8 968 ax-10 970 ax-12 972 ax-17 975 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1127 ax-10o 1144 ax-16 1214 ax-11o 1222 ax-ext 1464 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 985 df-sb 1176 df-clab 1470 df-cleq 1475 df-clel 1478 df-in 2062 df-ss 2064 |