| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onsucf1o | Structured version Visualization version GIF version | ||
| Description: The successor operation is a bijective function between the ordinals and the class of successor ordinals. Lemma 1.17 of [Schloeder] p. 2. (Contributed by RP, 18-Jan-2025.) |
| Ref | Expression |
|---|---|
| onsucf1o.f | ⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥) |
| Ref | Expression |
|---|---|
| onsucf1o | ⊢ 𝐹:On⟶1-1onto{𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onsucf1o.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥) | |
| 2 | 1 | fin1a2lem2 10506 | . . 3 ⊢ 𝐹:On⟶1-1On |
| 3 | f1fn 6801 | . . 3 ⊢ (𝐹:On⟶1-1On → 𝐹 Fn On) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ 𝐹 Fn On |
| 5 | 1 | onsucrn 44465 | . 2 ⊢ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} |
| 6 | 1 | fin1a2lem1 10505 | . . . . . 6 ⊢ (𝑎 ∈ On → (𝐹‘𝑎) = suc 𝑎) |
| 7 | 1 | fin1a2lem1 10505 | . . . . . 6 ⊢ (𝑏 ∈ On → (𝐹‘𝑏) = suc 𝑏) |
| 8 | 6, 7 | eqeqan12d 2777 | . . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ suc 𝑎 = suc 𝑏)) |
| 9 | suc11 6490 | . . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (suc 𝑎 = suc 𝑏 ↔ 𝑎 = 𝑏)) | |
| 10 | 8, 9 | bitrd 282 | . . . 4 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ 𝑎 = 𝑏)) |
| 11 | 10 | biimpd 232 | . . 3 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)) |
| 12 | 11 | rgen2 3206 | . 2 ⊢ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏) |
| 13 | dff1o6 7306 | . 2 ⊢ (𝐹:On⟶1-1onto{𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} ↔ (𝐹 Fn On ∧ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} ∧ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))) | |
| 14 | 4, 5, 12, 13 | mpbir3an 1360 | 1 ⊢ 𝐹:On⟶1-1onto{𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 {crab 3416 ↦ cmpt 5189 ran crn 5656 Oncon0 6380 suc csuc 6382 Fn wfn 6553 ⟶1-1wf1 6555 ⟶1-1ontowf1o 6557 ‘cfv 6558 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6383 df-on 6384 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |