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

Theorem oldval 28003
Description: The value of the old options function. (Contributed by Scott Fenton, 6-Aug-2024.)
Assertion
Ref Expression
oldval (𝐴 ∈ On → ( O ‘𝐴) = ( M “ 𝐴))

Proof of Theorem oldval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 df-made 27996 . . . . 5 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
2 recsfnon 8389 . . . . . . 7 recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))) Fn On
3 fnfun 6635 . . . . . . 7 (recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))) Fn On → Fun recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))))
42, 3ax-mp 5 . . . . . 6 Fun recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
5 funeq 6556 . . . . . 6 ( M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))) → (Fun M ↔ Fun recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))))
64, 5mpbiri 261 . . . . 5 ( M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))) → Fun M )
71, 6ax-mp 5 . . . 4 Fun M
8 funimaexg 6622 . . . 4 ((Fun M ∧ 𝐴 ∈ On) → ( M “ 𝐴) ∈ V)
97, 8mpan 702 . . 3 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
109uniexd 7740 . 2 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
11 imaeq2 6058 . . . 4 (𝑥 = 𝐴 → ( M “ 𝑥) = ( M “ 𝐴))
1211unieqd 4884 . . 3 (𝑥 = 𝐴 ( M “ 𝑥) = ( M “ 𝐴))
13 df-old 27997 . . 3 O = (𝑥 ∈ On ↦ ( M “ 𝑥))
1412, 13fvmptg 6987 . 2 ((𝐴 ∈ On ∧ ( M “ 𝐴) ∈ V) → ( O ‘𝐴) = ( M “ 𝐴))
1510, 14mpdan 699 1 (𝐴 ∈ On → ( O ‘𝐴) = ( M “ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1568  wcel 2141  Vcvv 3453  𝒫 cpw 4561   cuni 4871  cmpt 5191   × cxp 5659  ran crn 5662  cima 5664  Oncon0 6360  Fun wfun 6530   Fn wfn 6531  cfv 6536  recscrecs 8356   |s ccuts 27928   M cmade 27991   O cold 27992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-made 27996  df-old 27997
This theorem is referenced by:  old0  28008  elmade2  28027  elold  28028  old1  28034  oldss  28039  madeoldsuc  28054  oldfi  28083  oldfib  28546
  Copyright terms: Public domain W3C validator