| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfpss3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of proper subclass. (Contributed by NM, 7-Feb-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
| Ref | Expression |
|---|---|
| dfpss3 | ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐵 ⊆ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpss2 4043 | . 2 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵)) | |
| 2 | eqss 3953 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 3 | 2 | baib 545 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 = 𝐵 ↔ 𝐵 ⊆ 𝐴)) |
| 4 | 3 | notbid 321 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 ↔ ¬ 𝐵 ⊆ 𝐴)) |
| 5 | 4 | pm5.32i 585 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐵 ⊆ 𝐴)) |
| 6 | 1, 5 | bitri 278 | 1 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐵 ⊆ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 = wceq 1570 ⊆ wss 3906 ⊊ wpss 3907 |
| 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 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2757 df-ne 2961 df-ss 3923 df-pss 3926 |
| This theorem is used by: pssirrOLD 4059 pssn2lp 4060 ssnpss 4062 nsspssun 4221 pssdifcom1 4452 pssdifcom2 4453 php3 9200 fincssdom 10322 reclem2pr 11050 ressval3d 17330 islbs3 21331 ltslpss 28154 chpsscon3 31928 chpssati 32788 fundmpss 36298 lpssat 39847 lssat 39850 dihglblem6 42174 pssnssi 45879 mbfpsssmf 47557 |
| Copyright terms: Public domain | W3C validator |