| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sseq12 | GIF version | ||
| Description: Equality theorem for the subclass relationship. (Contributed by NM, 31-May-1999.) |
| Ref | Expression |
|---|---|
| sseq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq1 3250 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 2 | sseq2 3251 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) | |
| 3 | 1, 2 | sylan9bb 462 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ⊆ wss 3200 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-11 1554 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-in 3206 df-ss 3213 |
| This theorem is referenced by: sseq12i 3255 undifexmid 4283 exmidundif 4296 exmidundifim 4297 funcnvuni 5399 fun11iun 5604 |
| Copyright terms: Public domain | W3C validator |