Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onsucf1o Structured version   Visualization version   GIF version

Theorem onsucf1o 44596
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.)
Hypothesis
Ref Expression
onsucf1o.f 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
Assertion
Ref Expression
onsucf1o 𝐹:On⟶1-1onto{𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}
Distinct variable groups:   𝐹,𝑎,𝑏   𝑥,𝑎,𝑏
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem onsucf1o
StepHypRef Expression
1 onsucf1o.f . . . 4 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
21fin1a2lem2 10518 . . 3 𝐹:On⟶1-1On
3 f1fn 6809 . . 3 (𝐹:On⟶1-1On → 𝐹 Fn On)
42, 3ax-mp 5 . 2 𝐹 Fn On
51onsucrn 44595 . 2 ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}
61fin1a2lem1 10517 . . . . . 6 (𝑎 ∈ On → (𝐹‘𝑎) = suc 𝑎)
71fin1a2lem1 10517 . . . . . 6 (𝑏 ∈ On → (𝐹‘𝑏) = suc 𝑏)
86, 7eqeqan12d 2777 . . . . 5 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ suc 𝑎 = suc 𝑏))
9 suc11 6498 . . . . 5 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (suc 𝑎 = suc 𝑏 ↔ 𝑎 = 𝑏))
108, 9bitrd 282 . . . 4 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) ↔ 𝑎 = 𝑏))
1110biimpd 232 . . 3 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
1211rgen2 3206 . 2 ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)
13 dff1o6 7314 . 2 (𝐹:On⟶1-1onto{𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} ↔ (𝐹 Fn On ∧ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} ∧ ∀𝑎 ∈ On ∀𝑏 ∈ On ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
144, 5, 12, 13mpbir3an 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 5192  ran crn 5659  Oncon0 6388  suc csuc 6390   Fn wfn 6561  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566
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 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator