| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rex2dom | Structured version Visualization version GIF version | ||
| Description: A set that has at least 2 different members dominates ordinal 2. (Contributed by BTernaryTau, 30-Dec-2024.) |
| Ref | Expression |
|---|---|
| rex2dom | ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3475 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | prssi 4780 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴) | |
| 3 | df2o3 8515 | . . . . . . . 8 ⊢ 2o = {∅, 1o} | |
| 4 | 0ex 5265 | . . . . . . . . . 10 ⊢ ∅ ∈ V | |
| 5 | 4 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ∈ V) |
| 6 | 1oex 8517 | . . . . . . . . . 10 ⊢ 1o ∈ V | |
| 7 | 6 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 1o ∈ V) |
| 8 | vex 3458 | . . . . . . . . . 10 ⊢ 𝑥 ∈ V | |
| 9 | 8 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ∈ V) |
| 10 | vex 3458 | . . . . . . . . . 10 ⊢ 𝑦 ∈ V | |
| 11 | 10 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑦 ∈ V) |
| 12 | 1n0 8526 | . . . . . . . . . . 11 ⊢ 1o ≠ ∅ | |
| 13 | 12 | necomi 3013 | . . . . . . . . . 10 ⊢ ∅ ≠ 1o |
| 14 | 13 | a1i 11 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ∅ ≠ 1o) |
| 15 | id 23 | . . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → 𝑥 ≠ 𝑦) | |
| 16 | 5, 7, 9, 11, 14, 15 | en2prd 9106 | . . . . . . . 8 ⊢ (𝑥 ≠ 𝑦 → {∅, 1o} ≈ {𝑥, 𝑦}) |
| 17 | 3, 16 | eqbrtrid 5144 | . . . . . . 7 ⊢ (𝑥 ≠ 𝑦 → 2o ≈ {𝑥, 𝑦}) |
| 18 | endom 9037 | . . . . . . 7 ⊢ (2o ≈ {𝑥, 𝑦} → 2o ≼ {𝑥, 𝑦}) | |
| 19 | 17, 18 | syl 18 | . . . . . 6 ⊢ (𝑥 ≠ 𝑦 → 2o ≼ {𝑥, 𝑦}) |
| 20 | domssr 9057 | . . . . . . 7 ⊢ ((𝐴 ∈ V ∧ {𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴) | |
| 21 | 20 | 3expib 1140 | . . . . . 6 ⊢ (𝐴 ∈ V → (({𝑥, 𝑦} ⊆ 𝐴 ∧ 2o ≼ {𝑥, 𝑦}) → 2o ≼ 𝐴)) |
| 22 | 2, 19, 21 | syl2ani 619 | . . . . 5 ⊢ (𝐴 ∈ V → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≠ 𝑦) → 2o ≼ 𝐴)) |
| 23 | 22 | expd 421 | . . . 4 ⊢ (𝐴 ∈ V → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥 ≠ 𝑦 → 2o ≼ 𝐴))) |
| 24 | 23 | rexlimdvv 3222 | . . 3 ⊢ (𝐴 ∈ V → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 25 | 1, 24 | syl 18 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 → 2o ≼ 𝐴)) |
| 26 | 25 | imp 412 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∅c0 4281 {cpr 4590 class class class wbr 5106 1oc1o 8500 2oc2o 8501 ≈ cen 9001 ≼ cdom 9002 |
| 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-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pr 5396 |
| 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 2102 df-mo 2567 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 4839 df-br 5107 df-opab 5172 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-suc 6389 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-1o 8507 df-2o 8508 df-en 9005 df-dom 9006 |
| This theorem is used by: 1sdom2dom 9276 1sdom 9277 |
| Copyright terms: Public domain | W3C validator |