| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdom1 | Structured version Visualization version GIF version | ||
| Description: A set has less than one member iff it is empty. (Contributed by Stefan O'Rear, 28-Oct-2014.) Avoid ax-pow 5334, ax-un 7783. (Revised by BTernaryTau, 12-Dec-2024.) |
| Ref | Expression |
|---|---|
| sdom1 | ⊢ (𝐴 ≺ 1o ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df1o2 8521 | . . . . . . 7 ⊢ 1o = {∅} | |
| 2 | 1 | breq2i 5116 | . . . . . 6 ⊢ (𝐴 ≼ 1o ↔ 𝐴 ≼ {∅}) |
| 3 | brdomi 9024 | . . . . . . 7 ⊢ (𝐴 ≼ {∅} → ∃𝑓 𝑓:𝐴⟶1-1{∅}) | |
| 4 | f1cdmsn 7321 | . . . . . . . . . 10 ⊢ ((𝑓:𝐴⟶1-1{∅} ∧ 𝐴 ≠ ∅) → ∃𝑥 𝐴 = {𝑥}) | |
| 5 | vex 3458 | . . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V | |
| 6 | 5 | ensn1 9086 | . . . . . . . . . . . 12 ⊢ {𝑥} ≈ 1o |
| 7 | breq1 5111 | . . . . . . . . . . . 12 ⊢ (𝐴 = {𝑥} → (𝐴 ≈ 1o ↔ {𝑥} ≈ 1o)) | |
| 8 | 6, 7 | mpbiri 261 | . . . . . . . . . . 11 ⊢ (𝐴 = {𝑥} → 𝐴 ≈ 1o) |
| 9 | 8 | exlimiv 1965 | . . . . . . . . . 10 ⊢ (∃𝑥 𝐴 = {𝑥} → 𝐴 ≈ 1o) |
| 10 | 4, 9 | syl 18 | . . . . . . . . 9 ⊢ ((𝑓:𝐴⟶1-1{∅} ∧ 𝐴 ≠ ∅) → 𝐴 ≈ 1o) |
| 11 | 10 | expcom 419 | . . . . . . . 8 ⊢ (𝐴 ≠ ∅ → (𝑓:𝐴⟶1-1{∅} → 𝐴 ≈ 1o)) |
| 12 | 11 | exlimdv 1968 | . . . . . . 7 ⊢ (𝐴 ≠ ∅ → (∃𝑓 𝑓:𝐴⟶1-1{∅} → 𝐴 ≈ 1o)) |
| 13 | 3, 12 | syl5 35 | . . . . . 6 ⊢ (𝐴 ≠ ∅ → (𝐴 ≼ {∅} → 𝐴 ≈ 1o)) |
| 14 | 2, 13 | biimtrid 245 | . . . . 5 ⊢ (𝐴 ≠ ∅ → (𝐴 ≼ 1o → 𝐴 ≈ 1o)) |
| 15 | iman 407 | . . . . 5 ⊢ ((𝐴 ≼ 1o → 𝐴 ≈ 1o) ↔ ¬ (𝐴 ≼ 1o ∧ ¬ 𝐴 ≈ 1o)) | |
| 16 | 14, 15 | sylib 221 | . . . 4 ⊢ (𝐴 ≠ ∅ → ¬ (𝐴 ≼ 1o ∧ ¬ 𝐴 ≈ 1o)) |
| 17 | brsdom 9039 | . . . 4 ⊢ (𝐴 ≺ 1o ↔ (𝐴 ≼ 1o ∧ ¬ 𝐴 ≈ 1o)) | |
| 18 | 16, 17 | sylnibr 332 | . . 3 ⊢ (𝐴 ≠ ∅ → ¬ 𝐴 ≺ 1o) |
| 19 | 18 | necon4ai 2990 | . 2 ⊢ (𝐴 ≺ 1o → 𝐴 = ∅) |
| 20 | 1n0 8533 | . . . 4 ⊢ 1o ≠ ∅ | |
| 21 | 1oex 8524 | . . . . 5 ⊢ 1o ∈ V | |
| 22 | 21 | 0sdom 9165 | . . . 4 ⊢ (∅ ≺ 1o ↔ 1o ≠ ∅) |
| 23 | 20, 22 | mpbir 234 | . . 3 ⊢ ∅ ≺ 1o |
| 24 | breq1 5111 | . . 3 ⊢ (𝐴 = ∅ → (𝐴 ≺ 1o ↔ ∅ ≺ 1o)) | |
| 25 | 23, 24 | mpbiri 261 | . 2 ⊢ (𝐴 = ∅ → 𝐴 ≺ 1o) |
| 26 | 19, 25 | impbii 212 | 1 ⊢ (𝐴 ≺ 1o ↔ 𝐴 = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ≠ wne 2959 ∅c0 4281 {csn 4588 class class class wbr 5108 ⟶1-1wf1 6563 1oc1o 8507 ≈ cen 9008 ≼ cdom 9009 ≺ csdm 9010 |
| 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-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-1o 8514 df-en 9012 df-dom 9013 df-sdom 9014 |
| This theorem is used by: modom 9280 frgpcyg 21934 |
| Copyright terms: Public domain | W3C validator |