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

Theorem oldval 28038
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 28031 . . . . 5 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
2 recsfnon 8388 . . . . . . 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 7742 . 2 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
11 imaeq2 6057 . . . 4 (𝑥 = 𝐴 → ( M “ 𝑥) = ( M “ 𝐴))
1211unieqd 4884 . . 3 (𝑥 = 𝐴 ( M “ 𝑥) = ( M “ 𝐴))
13 df-old 28032 . . 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
This proof depends on syntax axioms:  wi 4   = wceq 1569  wcel 2142  Vcvv 3454  𝒫 cpw 4561   cuni 4871  cmpt 5191   × cxp 5658  ran crn 5661  cima 5663  Oncon0 6360  Fun wfun 6530   Fn wfn 6531  cfv 6536  recscrecs 8355   |s ccuts 27963   M cmade 28026   O cold 28027
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  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 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  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 7415  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-made 28031  df-old 28032
This theorem is used by:  old0  28043  elmade2  28062  elold  28063  old1  28069  oldss  28074  madeoldsuc  28089  oldfi  28118  oldfib  28581
  Copyright terms: Public domain W3C validator