| 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 3271 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
| 2 | sseq2 3272 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) | |
| 3 | 1, 2 | sylan9bb 466 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ⊆ wss 3220 |
| 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 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 theorem 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 referenced by: sseq12i 3276 undifexmid 4328 exmidundif 4341 exmidundifim 4342 funcnvuni 5448 fun11iun 5658 |
| Copyright terms: Public domain | W3C validator |