| 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 3939 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐶 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐵)) | |
| 2 | neeq2 3022 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵)) | |
| 3 | 1, 2 | anbi12d 644 | . 2 ⊢ (𝐴 = 𝐵 → ((𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ 𝐴) ↔ (𝐶 ⊆ 𝐵 ∧ 𝐶 ≠ 𝐵))) |
| 4 | df-pss 4017 | . 2 ⊢ (𝐶 ⊊ 𝐴 ↔ (𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ 𝐴)) | |
| 5 | df-pss 4017 | . 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 2959 ⊆ wss 3900 ⊊ wpss 4016 |
| 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 1945 ax-6 2002 ax-7 2043 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2755 df-ne 2960 df-ss 3901 df-pss 4017 |
| This theorem is used by: psseq2i 4023 psseq2d 4026 psssstr 4040 brrpssg 7768 sorpssint 7776 pssnn 9215 php 9253 isfin4 10405 fin2i2 10426 elnp 11102 elnpi 11103 ltprord 11145 pgpfac1lem1 20323 pgpfac1lem5 20328 lbsextlem4 21472 ssdifidlprm 21675 alexsubALTlem4 24402 spansncv 32288 cvbr 32917 cvcon3 32919 cvnbtwn 32921 cvbr4i 33002 ssmxidl 34083 dfon2lem6 36741 dfon2lem7 36742 dfon2lem8 36743 dfon2 36745 findcard4 38837 lcvbr 40281 lcvnbtwn 40285 lsatcv0 40291 lsat0cv 40293 islshpcv 40313 mapdcv 42920 pssn0 43485 |
| Copyright terms: Public domain | W3C validator |