| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 2dom | GIF version | ||
| Description: A set that dominates ordinal 2 has at least 2 different members. (Contributed by NM, 25-Jul-2004.) |
| Ref | Expression |
|---|---|
| 2dom | ⊢ (2o ≼ 𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df2o2 6597 | . . . 4 ⊢ 2o = {∅, {∅}} | |
| 2 | 1 | breq1i 4095 | . . 3 ⊢ (2o ≼ 𝐴 ↔ {∅, {∅}} ≼ 𝐴) |
| 3 | brdomi 6919 | . . 3 ⊢ ({∅, {∅}} ≼ 𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1→𝐴) | |
| 4 | 2, 3 | sylbi 121 | . 2 ⊢ (2o ≼ 𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1→𝐴) |
| 5 | f1f 5542 | . . . . 5 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → 𝑓:{∅, {∅}}⟶𝐴) | |
| 6 | 0ex 4216 | . . . . . 6 ⊢ ∅ ∈ V | |
| 7 | 6 | prid1 3777 | . . . . 5 ⊢ ∅ ∈ {∅, {∅}} |
| 8 | ffvelcdm 5780 | . . . . 5 ⊢ ((𝑓:{∅, {∅}}⟶𝐴 ∧ ∅ ∈ {∅, {∅}}) → (𝑓‘∅) ∈ 𝐴) | |
| 9 | 5, 7, 8 | sylancl 413 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → (𝑓‘∅) ∈ 𝐴) |
| 10 | p0ex 4278 | . . . . . 6 ⊢ {∅} ∈ V | |
| 11 | 10 | prid2 3778 | . . . . 5 ⊢ {∅} ∈ {∅, {∅}} |
| 12 | ffvelcdm 5780 | . . . . 5 ⊢ ((𝑓:{∅, {∅}}⟶𝐴 ∧ {∅} ∈ {∅, {∅}}) → (𝑓‘{∅}) ∈ 𝐴) | |
| 13 | 5, 11, 12 | sylancl 413 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → (𝑓‘{∅}) ∈ 𝐴) |
| 14 | 0nep0 4255 | . . . . . 6 ⊢ ∅ ≠ {∅} | |
| 15 | 14 | neii 2404 | . . . . 5 ⊢ ¬ ∅ = {∅} |
| 16 | f1fveq 5912 | . . . . . 6 ⊢ ((𝑓:{∅, {∅}}–1-1→𝐴 ∧ (∅ ∈ {∅, {∅}} ∧ {∅} ∈ {∅, {∅}})) → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅})) | |
| 17 | 7, 11, 16 | mpanr12 439 | . . . . 5 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅})) |
| 18 | 15, 17 | mtbiri 681 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ¬ (𝑓‘∅) = (𝑓‘{∅})) |
| 19 | eqeq1 2238 | . . . . . 6 ⊢ (𝑥 = (𝑓‘∅) → (𝑥 = 𝑦 ↔ (𝑓‘∅) = 𝑦)) | |
| 20 | 19 | notbid 673 | . . . . 5 ⊢ (𝑥 = (𝑓‘∅) → (¬ 𝑥 = 𝑦 ↔ ¬ (𝑓‘∅) = 𝑦)) |
| 21 | eqeq2 2241 | . . . . . 6 ⊢ (𝑦 = (𝑓‘{∅}) → ((𝑓‘∅) = 𝑦 ↔ (𝑓‘∅) = (𝑓‘{∅}))) | |
| 22 | 21 | notbid 673 | . . . . 5 ⊢ (𝑦 = (𝑓‘{∅}) → (¬ (𝑓‘∅) = 𝑦 ↔ ¬ (𝑓‘∅) = (𝑓‘{∅}))) |
| 23 | 20, 22 | rspc2ev 2925 | . . . 4 ⊢ (((𝑓‘∅) ∈ 𝐴 ∧ (𝑓‘{∅}) ∈ 𝐴 ∧ ¬ (𝑓‘∅) = (𝑓‘{∅})) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| 24 | 9, 13, 18, 23 | syl3anc 1273 | . . 3 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| 25 | 24 | exlimiv 1646 | . 2 ⊢ (∃𝑓 𝑓:{∅, {∅}}–1-1→𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| 26 | 4, 25 | syl 14 | 1 ⊢ (2o ≼ 𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 = wceq 1397 ∃wex 1540 ∈ wcel 2202 ∃wrex 2511 ∅c0 3494 {csn 3669 {cpr 3670 class class class wbr 4088 ⟶wf 5322 –1-1→wf1 5323 ‘cfv 5326 2oc2o 6575 ≼ cdom 6907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-id 4390 df-suc 4468 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fv 5334 df-1o 6581 df-2o 6582 df-dom 6910 |
| This theorem is referenced by: fundm2domnop0 11108 isnzr2 14197 |
| Copyright terms: Public domain | W3C validator |