| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psseq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for proper subclass. (Contributed by NM, 7-Feb-1996.) |
| Ref | Expression |
|---|---|
| psseq2 | ⊢ (𝐴 = 𝐵 → (𝐶 ⊊ 𝐴 ↔ 𝐶 ⊊ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq2 3957 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐶 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐵)) | |
| 2 | neeq2 3019 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵)) | |
| 3 | 1, 2 | anbi12d 644 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ 𝐴) ↔ (𝐶 ⊆ 𝐵 ∧ 𝐶 ≠ 𝐵))) |
| 4 | df-pss 3919 | . 2 ⊢ (𝐶 ⊊ 𝐴 ↔ (𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ 𝐴)) | |
| 5 | df-pss 3919 | . 2 ⊢ (𝐶 ⊊ 𝐵 ↔ (𝐶 ⊆ 𝐵 ∧ 𝐶 ≠ 𝐵)) | |
| 6 | 3, 4, 5 | 3bitr4g 317 | 1 ⊢ (𝐴 = 𝐵 → (𝐶 ⊊ 𝐴 ↔ 𝐶 ⊊ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ≠ wne 2956 ⊆ wss 3899 ⊊ wpss 3900 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2753 df-ne 2957 df-ss 3916 df-pss 3919 |
| This theorem is used by: psseq2i 4041 psseq2d 4044 psssstr 4058 brrpssg 7730 sorpssint 7738 pssnn 9168 php 9206 isfin4 10356 fin2i2 10377 elnp 11053 elnpi 11054 ltprord 11096 pgpfac1lem1 20270 pgpfac1lem5 20275 lbsextlem4 21419 ssdifidlprm 21622 alexsubALTlem4 24349 spansncv 32237 cvbr 32866 cvcon3 32868 cvnbtwn 32870 cvbr4i 32951 ssmxidl 33981 dfon2lem6 36520 dfon2lem7 36521 dfon2lem8 36522 dfon2 36524 findcard4 38600 lcvbr 40046 lcvnbtwn 40050 lsatcv0 40056 lsat0cv 40058 islshpcv 40078 mapdcv 42685 pssn0 43249 |
| Copyright terms: Public domain | W3C validator |