![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > isinfinf | GIF version |
Description: An infinite set contains subsets of arbitrarily large finite cardinality. (Contributed by Jim Kingdon, 15-Jun-2022.) |
Ref | Expression |
---|---|
isinfinf | ⊢ (ω ≼ 𝐴 → ∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | brdomi 6775 | . . . 4 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴) | |
2 | 1 | adantr 276 | . . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) → ∃𝑓 𝑓:ω–1-1→𝐴) |
3 | vex 2755 | . . . . 5 ⊢ 𝑓 ∈ V | |
4 | imaexg 5000 | . . . . 5 ⊢ (𝑓 ∈ V → (𝑓 “ 𝑛) ∈ V) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ (𝑓 “ 𝑛) ∈ V |
6 | imassrn 4999 | . . . . . 6 ⊢ (𝑓 “ 𝑛) ⊆ ran 𝑓 | |
7 | simpr 110 | . . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → 𝑓:ω–1-1→𝐴) | |
8 | f1f 5440 | . . . . . . 7 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴) | |
9 | frn 5393 | . . . . . . 7 ⊢ (𝑓:ω⟶𝐴 → ran 𝑓 ⊆ 𝐴) | |
10 | 7, 8, 9 | 3syl 17 | . . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → ran 𝑓 ⊆ 𝐴) |
11 | 6, 10 | sstrid 3181 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ 𝑛) ⊆ 𝐴) |
12 | ordom 4624 | . . . . . . . 8 ⊢ Ord ω | |
13 | ordelss 4397 | . . . . . . . 8 ⊢ ((Ord ω ∧ 𝑛 ∈ ω) → 𝑛 ⊆ ω) | |
14 | 12, 13 | mpan 424 | . . . . . . 7 ⊢ (𝑛 ∈ ω → 𝑛 ⊆ ω) |
15 | 14 | ad2antlr 489 | . . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → 𝑛 ⊆ ω) |
16 | simplr 528 | . . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → 𝑛 ∈ ω) | |
17 | f1imaeng 6818 | . . . . . 6 ⊢ ((𝑓:ω–1-1→𝐴 ∧ 𝑛 ⊆ ω ∧ 𝑛 ∈ ω) → (𝑓 “ 𝑛) ≈ 𝑛) | |
18 | 7, 15, 16, 17 | syl3anc 1249 | . . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ 𝑛) ≈ 𝑛) |
19 | 11, 18 | jca 306 | . . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → ((𝑓 “ 𝑛) ⊆ 𝐴 ∧ (𝑓 “ 𝑛) ≈ 𝑛)) |
20 | sseq1 3193 | . . . . . 6 ⊢ (𝑥 = (𝑓 “ 𝑛) → (𝑥 ⊆ 𝐴 ↔ (𝑓 “ 𝑛) ⊆ 𝐴)) | |
21 | breq1 4021 | . . . . . 6 ⊢ (𝑥 = (𝑓 “ 𝑛) → (𝑥 ≈ 𝑛 ↔ (𝑓 “ 𝑛) ≈ 𝑛)) | |
22 | 20, 21 | anbi12d 473 | . . . . 5 ⊢ (𝑥 = (𝑓 “ 𝑛) → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) ↔ ((𝑓 “ 𝑛) ⊆ 𝐴 ∧ (𝑓 “ 𝑛) ≈ 𝑛))) |
23 | 22 | spcegv 2840 | . . . 4 ⊢ ((𝑓 “ 𝑛) ∈ V → (((𝑓 “ 𝑛) ⊆ 𝐴 ∧ (𝑓 “ 𝑛) ≈ 𝑛) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛))) |
24 | 5, 19, 23 | mpsyl 65 | . . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) ∧ 𝑓:ω–1-1→𝐴) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛)) |
25 | 2, 24 | exlimddv 1910 | . 2 ⊢ ((ω ≼ 𝐴 ∧ 𝑛 ∈ ω) → ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛)) |
26 | 25 | ralrimiva 2563 | 1 ⊢ (ω ≼ 𝐴 → ∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∃wex 1503 ∈ wcel 2160 ∀wral 2468 Vcvv 2752 ⊆ wss 3144 class class class wbr 4018 Ord word 4380 ωcom 4607 ran crn 4645 “ cima 4647 ⟶wf 5231 –1-1→wf1 5232 ≈ cen 6764 ≼ cdom 6765 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-iinf 4605 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4311 df-iord 4384 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-er 6559 df-en 6767 df-dom 6768 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |