| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0sdom1dom | Structured version Visualization version GIF version | ||
| Description: Strict dominance over 0 is the same as dominance over 1. For a shorter proof requiring ax-un 7740, see 0sdom1domALT . (Contributed by NM, 28-Sep-2004.) Avoid ax-un 7740. (Revised by BTernaryTau, 7-Dec-2024.) |
| Ref | Expression |
|---|---|
| 0sdom1dom | ⊢ (∅ ≺ 𝐴 ↔ 1o ≼ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relsdom 8963 | . . 3 ⊢ Rel ≺ | |
| 2 | 1 | brrelex2i 5716 | . 2 ⊢ (∅ ≺ 𝐴 → 𝐴 ∈ V) |
| 3 | reldom 8962 | . . 3 ⊢ Rel ≼ | |
| 4 | 3 | brrelex2i 5716 | . 2 ⊢ (1o ≼ 𝐴 → 𝐴 ∈ V) |
| 5 | 0sdomg 9108 | . . 3 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 6 | n0 4303 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 7 | snssi 4749 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 8 | df1o2 8466 | . . . . . . . . . . 11 ⊢ 1o = {∅} | |
| 9 | 0ex 5268 | . . . . . . . . . . . 12 ⊢ ∅ ∈ V | |
| 10 | vex 3457 | . . . . . . . . . . . 12 ⊢ 𝑥 ∈ V | |
| 11 | en2sn 9052 | . . . . . . . . . . . 12 ⊢ ((∅ ∈ V ∧ 𝑥 ∈ V) → {∅} ≈ {𝑥}) | |
| 12 | 9, 10, 11 | mp2an 705 | . . . . . . . . . . 11 ⊢ {∅} ≈ {𝑥} |
| 13 | 8, 12 | eqbrtri 5130 | . . . . . . . . . 10 ⊢ 1o ≈ {𝑥} |
| 14 | endom 8989 | . . . . . . . . . 10 ⊢ (1o ≈ {𝑥} → 1o ≼ {𝑥}) | |
| 15 | 13, 14 | ax-mp 5 | . . . . . . . . 9 ⊢ 1o ≼ {𝑥} |
| 16 | domssr 9009 | . . . . . . . . 9 ⊢ ((𝐴 ∈ V ∧ {𝑥} ⊆ 𝐴 ∧ 1o ≼ {𝑥}) → 1o ≼ 𝐴) | |
| 17 | 15, 16 | mp3an3 1479 | . . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ {𝑥} ⊆ 𝐴) → 1o ≼ 𝐴) |
| 18 | 17 | ex 418 | . . . . . . 7 ⊢ (𝐴 ∈ V → ({𝑥} ⊆ 𝐴 → 1o ≼ 𝐴)) |
| 19 | 7, 18 | syl5 35 | . . . . . 6 ⊢ (𝐴 ∈ V → (𝑥 ∈ 𝐴 → 1o ≼ 𝐴)) |
| 20 | 19 | exlimdv 1966 | . . . . 5 ⊢ (𝐴 ∈ V → (∃𝑥 𝑥 ∈ 𝐴 → 1o ≼ 𝐴)) |
| 21 | 6, 20 | biimtrid 245 | . . . 4 ⊢ (𝐴 ∈ V → (𝐴 ≠ ∅ → 1o ≼ 𝐴)) |
| 22 | 1n0 8478 | . . . . . . 7 ⊢ 1o ≠ ∅ | |
| 23 | dom0 9107 | . . . . . . 7 ⊢ (1o ≼ ∅ ↔ 1o = ∅) | |
| 24 | 22, 23 | nemtbir 3053 | . . . . . 6 ⊢ ¬ 1o ≼ ∅ |
| 25 | breq2 5111 | . . . . . 6 ⊢ (𝐴 = ∅ → (1o ≼ 𝐴 ↔ 1o ≼ ∅)) | |
| 26 | 24, 25 | mtbiri 330 | . . . . 5 ⊢ (𝐴 = ∅ → ¬ 1o ≼ 𝐴) |
| 27 | 26 | necon2ai 2986 | . . . 4 ⊢ (1o ≼ 𝐴 → 𝐴 ≠ ∅) |
| 28 | 21, 27 | impbid1 228 | . . 3 ⊢ (𝐴 ∈ V → (𝐴 ≠ ∅ ↔ 1o ≼ 𝐴)) |
| 29 | 5, 28 | bitrd 282 | . 2 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 1o ≼ 𝐴)) |
| 30 | 2, 4, 29 | pm5.21nii 381 | 1 ⊢ (∅ ≺ 𝐴 ↔ 1o ≼ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2957 Vcvv 3453 ⊆ wss 3902 ∅c0 4282 {csn 4587 class class class wbr 5107 1oc1o 8452 ≈ cen 8953 ≼ cdom 8954 ≺ csdm 8955 |
| 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-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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-sb 2100 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-suc 6367 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-1o 8459 df-en 8957 df-dom 8958 df-sdom 8959 |
| This theorem is used by: 1sdom2 9222 1sdom2dom 9228 djulepw 10199 fin45 10398 gchxpidm 10682 rankcf 10790 snct 33192 |
| Copyright terms: Public domain | W3C validator |