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

Theorem madef 27828
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 27819 . . 3 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
21tfr1 8336 . 2 M Fn On
3 madeval2 27825 . . . . . . 7 (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)})
4 ssrab2 4020 . . . . . . 7 {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No
53, 4eqsstrdi 3966 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) ⊆ No )
6 sseq1 3947 . . . . . 6 (𝑦 = ( M ‘𝑥) → (𝑦 No ↔ ( M ‘𝑥) ⊆ No ))
75, 6syl5ibrcom 247 . . . . 5 (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 No ))
87rexlimiv 3131 . . . 4 (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 No )
9 vex 3433 . . . . 5 𝑦 ∈ V
10 eqeq1 2740 . . . . . 6 (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥)))
1110rexbidv 3161 . . . . 5 (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)))
12 fnrnfv 6899 . . . . . 6 ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)})
132, 12ax-mp 5 . . . . 5 ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}
149, 11, 13elab2 3625 . . . 4 (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))
15 velpw 4546 . . . 4 (𝑦 ∈ 𝒫 No 𝑦 No )
168, 14, 153imtr4i 292 . . 3 (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No )
1716ssriv 3925 . 2 ran M ⊆ 𝒫 No
18 df-f 6502 . 2 ( M :On⟶𝒫 No ↔ ( M Fn On ∧ ran M ⊆ 𝒫 No ))
192, 17, 18mpbir2an 712 1 M :On⟶𝒫 No
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  {crab 3389  Vcvv 3429  wss 3889  𝒫 cpw 4541   cuni 4850   class class class wbr 5085  cmpt 5166   × cxp 5629  ran crn 5632  cima 5634  Oncon0 6323   Fn wfn 6493  wf 6494  cfv 6498  (class class class)co 7367   No csur 27603   <<s cslts 27749   |s ccuts 27751   M cmade 27814
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-1o 8405  df-2o 8406  df-no 27606  df-lts 27607  df-bday 27608  df-slts 27750  df-cuts 27752  df-made 27819
This theorem is referenced by:  oldf  27829  newf  27830  madessno  27832  elmade  27849  elold  27851  old1  27857  madess  27858  madeoldsuc  27877  madebdayim  27880  madefi  27905  oldfi  27906  oldfib  28369
  Copyright terms: Public domain W3C validator