| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sseq2i | GIF version | ||
| Description: An equality inference for the subclass relationship. (Contributed by NM, 30-Aug-1993.) |
| Ref | Expression |
|---|---|
| sseq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| sseq2i | ⊢ (𝐶 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | sseq2 3272 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐵)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐶 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐵) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ↔ wb 105 = wceq 1402 ⊆ wss 3220 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-11 1559 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-in 3226 df-ss 3233 |
| This theorem is used by: sseqtri 3282 sseqtrdi 3296 abss 3317 ssrab 3326 ssintrab 3993 iunpwss 4104 iotass 5355 dffun2 5387 ssimaex 5764 pw1fin 7217 pw1dc0el 7218 ss1o0el1o 7220 isstructim 13366 isstructr 13367 issubm 13779 grpissubg 13997 issubrng 14507 umgredg 16386 bj-ssom 16962 ss1oel2o 17017 exmidnotnotr 17036 |
| Copyright terms: Public domain | W3C validator |