| 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 6663 | . . . 4 ⊢ 2o = {∅, {∅}} | |
| 2 | 1 | breq1i 4116 | . . 3 ⊢ (2o ≼ 𝐴 ↔ {∅, {∅}} ≼ 𝐴) |
| 3 | brdomi 6986 | . . 3 ⊢ ({∅, {∅}} ≼ 𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1→𝐴) | |
| 4 | 2, 3 | sylbi 121 | . 2 ⊢ (2o ≼ 𝐴 → ∃𝑓 𝑓:{∅, {∅}}–1-1→𝐴) |
| 5 | f1f 5573 | . . . . 5 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → 𝑓:{∅, {∅}}⟶𝐴) | |
| 6 | 0ex 4237 | . . . . . 6 ⊢ ∅ ∈ V | |
| 7 | 6 | prid1 3797 | . . . . 5 ⊢ ∅ ∈ {∅, {∅}} |
| 8 | ffvelcdm 5810 | . . . . 5 ⊢ ((𝑓:{∅, {∅}}⟶𝐴 ∧ ∅ ∈ {∅, {∅}}) → (𝑓‘∅) ∈ 𝐴) | |
| 9 | 5, 7, 8 | sylancl 413 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → (𝑓‘∅) ∈ 𝐴) |
| 10 | p0ex 4301 | . . . . . 6 ⊢ {∅} ∈ V | |
| 11 | 10 | prid2 3798 | . . . . 5 ⊢ {∅} ∈ {∅, {∅}} |
| 12 | ffvelcdm 5810 | . . . . 5 ⊢ ((𝑓:{∅, {∅}}⟶𝐴 ∧ {∅} ∈ {∅, {∅}}) → (𝑓‘{∅}) ∈ 𝐴) | |
| 13 | 5, 11, 12 | sylancl 413 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → (𝑓‘{∅}) ∈ 𝐴) |
| 14 | 0nep0 4278 | . . . . . 6 ⊢ ∅ ≠ {∅} | |
| 15 | 14 | neii 2414 | . . . . 5 ⊢ ¬ ∅ = {∅} |
| 16 | f1fveq 5945 | . . . . . 6 ⊢ ((𝑓:{∅, {∅}}–1-1→𝐴 ∧ (∅ ∈ {∅, {∅}} ∧ {∅} ∈ {∅, {∅}})) → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅})) | |
| 17 | 7, 11, 16 | mpanr12 439 | . . . . 5 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ((𝑓‘∅) = (𝑓‘{∅}) ↔ ∅ = {∅})) |
| 18 | 15, 17 | mtbiri 682 | . . . 4 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ¬ (𝑓‘∅) = (𝑓‘{∅})) |
| 19 | eqeq1 2239 | . . . . . 6 ⊢ (𝑥 = (𝑓‘∅) → (𝑥 = 𝑦 ↔ (𝑓‘∅) = 𝑦)) | |
| 20 | 19 | notbid 673 | . . . . 5 ⊢ (𝑥 = (𝑓‘∅) → (¬ 𝑥 = 𝑦 ↔ ¬ (𝑓‘∅) = 𝑦)) |
| 21 | eqeq2 2242 | . . . . . 6 ⊢ (𝑦 = (𝑓‘{∅}) → ((𝑓‘∅) = 𝑦 ↔ (𝑓‘∅) = (𝑓‘{∅}))) | |
| 22 | 21 | notbid 673 | . . . . 5 ⊢ (𝑦 = (𝑓‘{∅}) → (¬ (𝑓‘∅) = 𝑦 ↔ ¬ (𝑓‘∅) = (𝑓‘{∅}))) |
| 23 | 20, 22 | rspc2ev 2936 | . . . 4 ⊢ (((𝑓‘∅) ∈ 𝐴 ∧ (𝑓‘{∅}) ∈ 𝐴 ∧ ¬ (𝑓‘∅) = (𝑓‘{∅})) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| 24 | 9, 13, 18, 23 | syl3anc 1274 | . . 3 ⊢ (𝑓:{∅, {∅}}–1-1→𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) |
| 25 | 24 | exlimiv 1647 | . 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 1398 ∃wex 1541 ∈ wcel 2203 ∃wrex 2521 ∅c0 3508 {csn 3689 {cpr 3690 class class class wbr 4109 ⟶wf 5348 –1-1→wf1 5349 ‘cfv 5352 2oc2o 6641 ≼ cdom 6974 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-id 4414 df-suc 4492 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fv 5360 df-1o 6647 df-2o 6648 df-dom 6977 |
| This theorem is referenced by: fundm2domnop0 11220 isnzr2 14329 |
| Copyright terms: Public domain | W3C validator |