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

Theorem madef 27853
Description: The made function is a function from ordinals to sets of surreals. (Contributed by Scott Fenton, 6-Aug-2024.)
Assertion
Ref Expression
madef M :On⟶𝒫 No

Proof of Theorem madef
Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-made 27844 . . 3 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
21tfr1 8333 . 2 M Fn On
3 madeval2 27850 . . . . . . 7 (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)})
4 ssrab2 4018 . . . . . . 7 {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No
53, 4eqsstrdi 3966 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) ⊆ No )
6 sseq1 3947 . . . . . 6 (𝑦 = ( M ‘𝑥) → (𝑦 No ↔ ( M ‘𝑥) ⊆ No ))
75, 6syl5ibrcom 248 . . . . 5 (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 No ))
87rexlimiv 3134 . . . 4 (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 No )
9 vex 3436 . . . . 5 𝑦 ∈ V
10 eqeq1 2744 . . . . . 6 (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥)))
1110rexbidv 3164 . . . . 5 (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)))
12 fnrnfv 6893 . . . . . 6 ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)})
132, 12ax-mp 5 . . . . 5 ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}
149, 11, 13elab2 3627 . . . 4 (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))
15 velpw 4541 . . . 4 (𝑦 ∈ 𝒫 No 𝑦 No )
168, 14, 153imtr4i 293 . . 3 (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No )
1716ssriv 3926 . 2 ran M ⊆ 𝒫 No
18 df-f 6496 . 2 ( M :On⟶𝒫 No ↔ ( M Fn On ∧ ran M ⊆ 𝒫 No ))
192, 17, 18mpbir2an 717 1 M :On⟶𝒫 No
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1547  wcel 2119  {cab 2718  wrex 3064  {crab 3392  Vcvv 3432  wss 3890  𝒫 cpw 4536   cuni 4845   class class class wbr 5079  cmpt 5160   × cxp 5623  ran crn 5626  cima 5628  Oncon0 6317   Fn wfn 6487  wf 6488  cfv 6492  (class class class)co 7363   No csur 27628   <<s cslts 27774   |s ccuts 27776   M cmade 27839
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-1o 8402  df-2o 8403  df-no 27631  df-lts 27632  df-bday 27633  df-slts 27775  df-cuts 27777  df-made 27844
This theorem is referenced by:  oldf  27854  newf  27855  madessno  27857  elmade  27874  elold  27876  old1  27882  madess  27883  madeoldsuc  27902  madebdayim  27905  madefi  27930  oldfi  27931  oldfib  28394
  Copyright terms: Public domain W3C validator