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

Theorem madef 27844
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 27835 . . 3 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
21tfr1 8338 . 2 M Fn On
3 madeval2 27841 . . . . . . 7 (𝑥 ∈ On → ( M ‘𝑥) = {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)})
4 ssrab2 4034 . . . . . . 7 {𝑦 No ∣ ∃𝑧 ∈ 𝒫 ( M “ 𝑥)∃𝑤 ∈ 𝒫 ( M “ 𝑥)(𝑧 <<s 𝑤 ∧ (𝑧 |s 𝑤) = 𝑦)} ⊆ No
53, 4eqsstrdi 3980 . . . . . 6 (𝑥 ∈ On → ( M ‘𝑥) ⊆ No )
6 sseq1 3961 . . . . . 6 (𝑦 = ( M ‘𝑥) → (𝑦 No ↔ ( M ‘𝑥) ⊆ No ))
75, 6syl5ibrcom 247 . . . . 5 (𝑥 ∈ On → (𝑦 = ( M ‘𝑥) → 𝑦 No ))
87rexlimiv 3132 . . . 4 (∃𝑥 ∈ On 𝑦 = ( M ‘𝑥) → 𝑦 No )
9 vex 3446 . . . . 5 𝑦 ∈ V
10 eqeq1 2741 . . . . . 6 (𝑧 = 𝑦 → (𝑧 = ( M ‘𝑥) ↔ 𝑦 = ( M ‘𝑥)))
1110rexbidv 3162 . . . . 5 (𝑧 = 𝑦 → (∃𝑥 ∈ On 𝑧 = ( M ‘𝑥) ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥)))
12 fnrnfv 6901 . . . . . 6 ( M Fn On → ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)})
132, 12ax-mp 5 . . . . 5 ran M = {𝑧 ∣ ∃𝑥 ∈ On 𝑧 = ( M ‘𝑥)}
149, 11, 13elab2 3639 . . . 4 (𝑦 ∈ ran M ↔ ∃𝑥 ∈ On 𝑦 = ( M ‘𝑥))
15 velpw 4561 . . . 4 (𝑦 ∈ 𝒫 No 𝑦 No )
168, 14, 153imtr4i 292 . . 3 (𝑦 ∈ ran M → 𝑦 ∈ 𝒫 No )
1716ssriv 3939 . 2 ran M ⊆ 𝒫 No
18 df-f 6504 . 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 2715  wrex 3062  {crab 3401  Vcvv 3442  wss 3903  𝒫 cpw 4556   cuni 4865   class class class wbr 5100  cmpt 5181   × cxp 5630  ran crn 5633  cima 5635  Oncon0 6325   Fn wfn 6495  wf 6496  cfv 6500  (class class class)co 7368   No csur 27619   <<s cslts 27765   |s ccuts 27767   M cmade 27830
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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768  df-made 27835
This theorem is referenced by:  oldf  27845  newf  27846  madessno  27848  elmade  27865  elold  27867  old1  27873  madess  27874  madeoldsuc  27893  madebdayim  27896  madefi  27921  oldfi  27922  oldfib  28385
  Copyright terms: Public domain W3C validator