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

Theorem oldval 28153
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 28146 . . . . 5 M = recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥))))
2 recsfnon 8389 . . . . . . 7 recs((𝑥 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑥 × 𝒫 ∪ ran 𝑥)))) Fn On
3 fnfun 6627 . . . . . . 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 6547 . . . . . 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 6614 . . . 4 ((Fun M ∧ 𝐴 ∈ On) → ( M “ 𝐴) ∈ V)
97, 8mpan 703 . . 3 (𝐴 ∈ On → ( M “ 𝐴) ∈ V)
109uniexd 7742 . 2 (𝐴 ∈ On → ∪ ( M “ 𝐴) ∈ V)
11 imaeq2 6046 . . . 4 (𝑥 = 𝐴 → ( M “ 𝑥) = ( M “ 𝐴))
1211unieqd 4879 . . 3 (𝑥 = 𝐴 → ∪ ( M “ 𝑥) = ∪ ( M “ 𝐴))
13 df-old 28147 . . 3 O = (𝑥 ∈ On ↦ ∪ ( M “ 𝑥))
1412, 13fvmptg 6979 . 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 3450  𝒫 cpw 4556  ∪ cuni 4866   ↦ cmpt 5185   × cxp 5645  ran crn 5648   “ cima 5650  Oncon0 6351  Fun wfun 6521   Fn wfn 6522  ‘cfv 6527  recscrecs 8356   |s ccuts 28078   M cmade 28141   O cold 28142
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 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7734
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-made 28146  df-old 28147
This theorem is used by:  old0  28158  elmade2  28177  elold  28178  old1  28184  oldss  28189  madeoldsuc  28204  oldfi  28233  oldfib  28696
  Copyright terms: Public domain W3C validator