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

Theorem oldval 28097
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 28090 . . . . 5 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥))))
2 recsfnon 8395 . . . . . . 7 recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ran 𝑥 × 𝒫 ran 𝑥)))) Fn On
3 fnfun 6636 . . . . . . 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 6557 . . . . . 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 6623 . . . 4 ((Fun M ∧ 𝐴 ∈ On) → ( M “ 𝐴) ∈ V)
97, 8mpan 703 . . 3 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
109uniexd 7747 . 2 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
11 imaeq2 6056 . . . 4 (𝑥 = 𝐴 → ( M “ 𝑥) = ( M “ 𝐴))
1211unieqd 4883 . . 3 (𝑥 = 𝐴 ( M “ 𝑥) = ( M “ 𝐴))
13 df-old 28091 . . 3 O = (𝑥 ∈ On ↦ ( M “ 𝑥))
1412, 13fvmptg 6988 . 2 ((𝐴 ∈ On ∧ ( M “ 𝐴) ∈ V) → ( O ‘𝐴) = ( M “ 𝐴))
1510, 14mpdan 700 1 (𝐴 ∈ On → ( O ‘𝐴) = ( M “ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  Vcvv 3453  𝒫 cpw 4560   cuni 4870  cmpt 5190   × cxp 5657  ran crn 5660  cima 5662  Oncon0 6361  Fun wfun 6531   Fn wfn 6532  cfv 6537  recscrecs 8362   |s ccuts 28022   M cmade 28085   O cold 28086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-made 28090  df-old 28091
This theorem is used by:  old0  28102  elmade2  28121  elold  28122  old1  28128  oldss  28133  madeoldsuc  28148  oldfi  28177  oldfib  28640
  Copyright terms: Public domain W3C validator