| 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 6852 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) | |
| 2 | 1 | biimpi 120 | . . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) |
| 3 | 2 | adantl 277 | . . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) → ∃𝑛 ∈ ω 𝐴 ≈ 𝑛) |
| 4 | omex 4641 | . . . . . 6 ⊢ ω ∈ V | |
| 5 | ordom 4655 | . . . . . . 7 ⊢ Ord ω | |
| 6 | peano2 4643 | . . . . . . . 8 ⊢ (𝑛 ∈ ω → suc 𝑛 ∈ ω) | |
| 7 | 6 | ad2antrl 490 | . . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ∈ ω) |
| 8 | ordelss 4426 | . . . . . . 7 ⊢ ((Ord ω ∧ suc 𝑛 ∈ ω) → suc 𝑛 ⊆ ω) | |
| 9 | 5, 7, 8 | sylancr 414 | . . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ⊆ ω) |
| 10 | ssdomg 6870 | . . . . . 6 ⊢ (ω ∈ V → (suc 𝑛 ⊆ ω → suc 𝑛 ≼ ω)) | |
| 11 | 4, 9, 10 | mpsyl 65 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ≼ ω) |
| 12 | domentr 6883 | . . . . . 6 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ≈ 𝑛) → ω ≼ 𝑛) | |
| 13 | 12 | ad2ant2rl 511 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ω ≼ 𝑛) |
| 14 | domtr 6877 | . . . . 5 ⊢ ((suc 𝑛 ≼ ω ∧ ω ≼ 𝑛) → suc 𝑛 ≼ 𝑛) | |
| 15 | 11, 13, 14 | syl2anc 411 | . . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → suc 𝑛 ≼ 𝑛) |
| 16 | php5dom 6960 | . . . . 5 ⊢ (𝑛 ∈ ω → ¬ suc 𝑛 ≼ 𝑛) | |
| 17 | 16 | ad2antrl 490 | . . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ¬ suc 𝑛 ≼ 𝑛) |
| 18 | 15, 17 | pm2.21dd 621 | . . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) ∧ (𝑛 ∈ ω ∧ 𝐴 ≈ 𝑛)) → ¬ 𝐴 ∈ Fin) |
| 19 | 3, 18 | rexlimddv 2628 | . 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ∈ Fin) → ¬ 𝐴 ∈ Fin) |
| 20 | 19 | pm2.01da 637 | 1 ⊢ (ω ≼ 𝐴 → ¬ 𝐴 ∈ Fin) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∈ wcel 2176 ∃wrex 2485 Vcvv 2772 ⊆ wss 3166 class class class wbr 4044 Ord word 4409 suc csuc 4412 ωcom 4638 ≈ cen 6825 ≼ cdom 6826 Fincfn 6827 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-nul 4170 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-iinf 4636 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-rab 2493 df-v 2774 df-sbc 2999 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-nul 3461 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-br 4045 df-opab 4106 df-tr 4143 df-id 4340 df-iord 4413 df-on 4415 df-suc 4418 df-iom 4639 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fo 5277 df-f1o 5278 df-fv 5279 df-er 6620 df-en 6828 df-dom 6829 df-fin 6830 |
| This theorem is referenced by: ominf 6993 hashennnuni 10924 |
| Copyright terms: Public domain | W3C validator |