![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > hashinfuni | GIF version |
Description: The ordinal size of an infinite set is ω. (Contributed by Jim Kingdon, 20-Feb-2022.) |
Ref | Expression |
---|---|
hashinfuni | ⊢ (ω ≼ 𝐴 → ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} = ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | omex 4625 | . . . . . 6 ⊢ ω ∈ V | |
2 | 1 | snid 3649 | . . . . 5 ⊢ ω ∈ {ω} |
3 | elun2 3327 | . . . . 5 ⊢ (ω ∈ {ω} → ω ∈ (ω ∪ {ω})) | |
4 | breq1 4032 | . . . . . 6 ⊢ (𝑦 = ω → (𝑦 ≼ 𝐴 ↔ ω ≼ 𝐴)) | |
5 | 4 | elrab3 2917 | . . . . 5 ⊢ (ω ∈ (ω ∪ {ω}) → (ω ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} ↔ ω ≼ 𝐴)) |
6 | 2, 3, 5 | mp2b 8 | . . . 4 ⊢ (ω ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} ↔ ω ≼ 𝐴) |
7 | 6 | biimpri 133 | . . 3 ⊢ (ω ≼ 𝐴 → ω ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}) |
8 | elrabi 2913 | . . . . . . 7 ⊢ (𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} → 𝑧 ∈ (ω ∪ {ω})) | |
9 | elun 3300 | . . . . . . 7 ⊢ (𝑧 ∈ (ω ∪ {ω}) ↔ (𝑧 ∈ ω ∨ 𝑧 ∈ {ω})) | |
10 | 8, 9 | sylib 122 | . . . . . 6 ⊢ (𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} → (𝑧 ∈ ω ∨ 𝑧 ∈ {ω})) |
11 | ordom 4639 | . . . . . . . 8 ⊢ Ord ω | |
12 | ordelss 4410 | . . . . . . . 8 ⊢ ((Ord ω ∧ 𝑧 ∈ ω) → 𝑧 ⊆ ω) | |
13 | 11, 12 | mpan 424 | . . . . . . 7 ⊢ (𝑧 ∈ ω → 𝑧 ⊆ ω) |
14 | elsni 3636 | . . . . . . . 8 ⊢ (𝑧 ∈ {ω} → 𝑧 = ω) | |
15 | eqimss 3233 | . . . . . . . 8 ⊢ (𝑧 = ω → 𝑧 ⊆ ω) | |
16 | 14, 15 | syl 14 | . . . . . . 7 ⊢ (𝑧 ∈ {ω} → 𝑧 ⊆ ω) |
17 | 13, 16 | jaoi 717 | . . . . . 6 ⊢ ((𝑧 ∈ ω ∨ 𝑧 ∈ {ω}) → 𝑧 ⊆ ω) |
18 | 10, 17 | syl 14 | . . . . 5 ⊢ (𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} → 𝑧 ⊆ ω) |
19 | 18 | adantl 277 | . . . 4 ⊢ ((ω ≼ 𝐴 ∧ 𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}) → 𝑧 ⊆ ω) |
20 | 19 | ralrimiva 2567 | . . 3 ⊢ (ω ≼ 𝐴 → ∀𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}𝑧 ⊆ ω) |
21 | ssunieq 3868 | . . 3 ⊢ ((ω ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} ∧ ∀𝑧 ∈ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}𝑧 ⊆ ω) → ω = ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}) | |
22 | 7, 20, 21 | syl2anc 411 | . 2 ⊢ (ω ≼ 𝐴 → ω = ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴}) |
23 | 22 | eqcomd 2199 | 1 ⊢ (ω ≼ 𝐴 → ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} = ω) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 ∨ wo 709 = wceq 1364 ∈ wcel 2164 ∀wral 2472 {crab 2476 ∪ cun 3151 ⊆ wss 3153 {csn 3618 ∪ cuni 3835 class class class wbr 4029 Ord word 4393 ωcom 4622 ≼ cdom 6793 |
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 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-iinf 4620 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-tr 4128 df-iord 4397 df-suc 4402 df-iom 4623 |
This theorem is referenced by: hashinfom 10849 |
Copyright terms: Public domain | W3C validator |