![]() |
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 3047 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐶)) | |
2 | sseq2 3048 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) | |
3 | 1, 2 | sylan9bb 450 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊆ 𝐶 ↔ 𝐵 ⊆ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1289 ⊆ wss 2999 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-11 1442 ax-4 1445 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 |
This theorem depends on definitions: df-bi 115 df-nf 1395 df-sb 1693 df-clab 2075 df-cleq 2081 df-clel 2084 df-in 3005 df-ss 3012 |
This theorem is referenced by: sseq12i 3052 undifexmid 4028 exmidundif 4035 funcnvuni 5083 fun11iun 5274 |
Copyright terms: Public domain | W3C validator |