| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > infnfi | GIF version | ||
| Description: An infinite set is not finite. (Contributed by Jim Kingdon, 20-Feb-2022.) |
| Ref | Expression |
|---|---|
| infnfi | ⊢ (ω ≼ 𝐴 → ¬ 𝐴 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfi 6910 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) | |
| 2 | 1 | biimpi 120 | . . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) |
| 3 | 2 | adantl 277 | . . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) |
| 4 | omex 4684 | . . . . . 6 ⊢ ω ∈ V | |
| 5 | ordom 4698 | . . . . . . 7 ⊢ Ord ω | |
| 6 | peano2 4686 | . . . . . . . 8 ⊢ (𝑛 ∈ ω → suc 𝑛 ∈ ω) | |
| 7 | 6 | ad2antrl 490 | . . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ∈ ω) |
| 8 | ordelss 4469 | . . . . . . 7 ⊢ ((Ord ω ∧ suc 𝑛 ∈ ω) → suc 𝑛 ⊆ ω) | |
| 9 | 5, 7, 8 | sylancr 414 | . . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ⊆ ω) |
| 10 | ssdomg 6928 | . . . . . 6 ⊢ (ω ∈ V → (suc 𝑛 ⊆ ω → suc 𝑛 ≼ ω)) | |
| 11 | 4, 9, 10 | mpsyl 65 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ≼ ω) |
| 12 | domentr 6941 | . . . . . 6 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ≈ 𝑛) → ω ≼ 𝑛) | |
| 13 | 12 | ad2ant2rl 511 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ω ≼ 𝑛) |
| 14 | domtr 6935 | . . . . 5 ⊢ ((suc 𝑛 ≼ ω ∧ ω ≼ 𝑛) → suc 𝑛 ≼ 𝑛) | |
| 15 | 11, 13, 14 | syl2anc 411 | . . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ≼ 𝑛) |
| 16 | php5dom 7020 | . . . . 5 ⊢ (𝑛 ∈ ω → ¬ suc 𝑛 ≼ 𝑛) | |
| 17 | 16 | ad2antrl 490 | . . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ¬ suc 𝑛 ≼ 𝑛) |
| 18 | 15, 17 | pm2.21dd 623 | . . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ¬ 𝐴 ∈ Fin) |
| 19 | 3, 18 | rexlimddv 2653 | . 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) → ¬ 𝐴 ∈ Fin) |
| 20 | 19 | pm2.01da 639 | 1 ⊢ (ω ≼ 𝐴 → ¬ 𝐴 ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∈ wcel 2200 ∃wrex 2509 Vcvv 2799 ⊆ wss 3197 class class class wbr 4082 Ord word 4452 suc csuc 4455 ωcom 4681 ≈ cen 6883 ≼ cdom 6884 Fincfn 6885 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-nul 4209 ax-pow 4257 ax-pr 4292 ax-un 4523 ax-setind 4628 ax-iinf 4679 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-int 3923 df-br 4083 df-opab 4145 df-tr 4182 df-id 4383 df-iord 4456 df-on 4458 df-suc 4461 df-iom 4682 df-xp 4724 df-rel 4725 df-cnv 4726 df-co 4727 df-dm 4728 df-rn 4729 df-res 4730 df-ima 4731 df-iota 5277 df-fun 5319 df-fn 5320 df-f 5321 df-f1 5322 df-fo 5323 df-f1o 5324 df-fv 5325 df-er 6678 df-en 6886 df-dom 6887 df-fin 6888 |
| This theorem is referenced by: ominf 7054 hashennnuni 10996 |
| Copyright terms: Public domain | W3C validator |