MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bdayfo Structured version   Visualization version   GIF version

Theorem bdayfo 27596
Description: The birthday function maps the surreals onto the ordinals. Axiom B of [Alling] p. 184. (Proof shortened on 14-Apr-2012 by SF). (Contributed by Scott Fenton, 11-Jun-2011.)
Assertion
Ref Expression
bdayfo bday : No onto→On

Proof of Theorem bdayfo
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmexg 7880 . . . 4 (𝑥 No → dom 𝑥 ∈ V)
21rgen 3047 . . 3 𝑥 No dom 𝑥 ∈ V
3 df-bday 27563 . . . 4 bday = (𝑥 No ↦ dom 𝑥)
43mptfng 6660 . . 3 (∀𝑥 No dom 𝑥 ∈ V ↔ bday Fn No )
52, 4mpbi 230 . 2 bday Fn No
63rnmpt 5924 . . 3 ran bday = {𝑦 ∣ ∃𝑥 No 𝑦 = dom 𝑥}
7 noxp1o 27582 . . . . . 6 (𝑦 ∈ On → (𝑦 × {1o}) ∈ No )
8 1oex 8447 . . . . . . . . 9 1o ∈ V
98snnz 4743 . . . . . . . 8 {1o} ≠ ∅
10 dmxp 5895 . . . . . . . 8 ({1o} ≠ ∅ → dom (𝑦 × {1o}) = 𝑦)
119, 10ax-mp 5 . . . . . . 7 dom (𝑦 × {1o}) = 𝑦
1211eqcomi 2739 . . . . . 6 𝑦 = dom (𝑦 × {1o})
13 dmeq 5870 . . . . . . 7 (𝑥 = (𝑦 × {1o}) → dom 𝑥 = dom (𝑦 × {1o}))
1413rspceeqv 3614 . . . . . 6 (((𝑦 × {1o}) ∈ No 𝑦 = dom (𝑦 × {1o})) → ∃𝑥 No 𝑦 = dom 𝑥)
157, 12, 14sylancl 586 . . . . 5 (𝑦 ∈ On → ∃𝑥 No 𝑦 = dom 𝑥)
16 nodmon 27569 . . . . . . 7 (𝑥 No → dom 𝑥 ∈ On)
17 eleq1a 2824 . . . . . . 7 (dom 𝑥 ∈ On → (𝑦 = dom 𝑥𝑦 ∈ On))
1816, 17syl 17 . . . . . 6 (𝑥 No → (𝑦 = dom 𝑥𝑦 ∈ On))
1918rexlimiv 3128 . . . . 5 (∃𝑥 No 𝑦 = dom 𝑥𝑦 ∈ On)
2015, 19impbii 209 . . . 4 (𝑦 ∈ On ↔ ∃𝑥 No 𝑦 = dom 𝑥)
2120eqabi 2864 . . 3 On = {𝑦 ∣ ∃𝑥 No 𝑦 = dom 𝑥}
226, 21eqtr4i 2756 . 2 ran bday = On
23 df-fo 6520 . 2 ( bday : No onto→On ↔ ( bday Fn No ∧ ran bday = On))
245, 22, 23mpbir2an 711 1 bday : No onto→On
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  {cab 2708  wne 2926  wral 3045  wrex 3054  Vcvv 3450  c0 4299  {csn 4592   × cxp 5639  dom cdm 5641  ran crn 5642  Oncon0 6335   Fn wfn 6509  ontowfo 6512  1oc1o 8430   No csur 27558   bday cbday 27560
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-suc 6341  df-fun 6516  df-fn 6517  df-f 6518  df-fo 6520  df-1o 8437  df-no 27561  df-bday 27563
This theorem is referenced by:  nodense  27611  bdayimaon  27612  nosupno  27622  nosupbday  27624  noinfno  27637  noinfbday  27639  noetasuplem4  27655  noetainflem4  27659  bdayfun  27691  bdayfn  27692  bdaydm  27693  bdayrn  27694  bdayelon  27695  noprc  27698  noeta2  27703
  Copyright terms: Public domain W3C validator