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

Theorem newval 27982
Description: The value of the new options function. (Contributed by Scott Fenton, 9-Oct-2024.)
Assertion
Ref Expression
newval ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))

Proof of Theorem newval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6871 . . . 4 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
2 fveq2 6871 . . . 4 (𝑥 = 𝐴 → ( O ‘𝑥) = ( O ‘𝐴))
31, 2difeq12d 4084 . . 3 (𝑥 = 𝐴 → (( M ‘𝑥) ∖ ( O ‘𝑥)) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
4 df-new 27976 . . 3 N = (𝑥 ∈ On ↦ (( M ‘𝑥) ∖ ( O ‘𝑥)))
5 fvex 6884 . . . 4 ( M ‘𝐴) ∈ V
65difexi 5290 . . 3 (( M ‘𝐴) ∖ ( O ‘𝐴)) ∈ V
73, 4, 6fvmpt 6979 . 2 (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
84fvmptndm 7011 . . 3 𝐴 ∈ On → ( N ‘𝐴) = ∅)
9 df-made 27974 . . . . . . . . 9 M = recs((𝑓 ∈ V ↦ ( |s “ (𝒫 ran 𝑓 × 𝒫 ran 𝑓))))
109tfr1 8372 . . . . . . . 8 M Fn On
1110fndmi 6629 . . . . . . 7 dom M = On
1211eleq2i 2857 . . . . . 6 (𝐴 ∈ dom M ↔ 𝐴 ∈ On)
13 ndmfv 6903 . . . . . 6 𝐴 ∈ dom M → ( M ‘𝐴) = ∅)
1412, 13sylnbir 334 . . . . 5 𝐴 ∈ On → ( M ‘𝐴) = ∅)
1514difeq1d 4082 . . . 4 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = (∅ ∖ ( O ‘𝐴)))
16 0dif 4362 . . . 4 (∅ ∖ ( O ‘𝐴)) = ∅
1715, 16eqtrdi 2816 . . 3 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = ∅)
188, 17eqtr4d 2803 . 2 𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
197, 18pm2.61i 184 1 ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1563  wcel 2145  Vcvv 3457  cdif 3904  c0 4288  𝒫 cpw 4558   cuni 4867  cmpt 5185   × cxp 5649  dom cdm 5651  ran crn 5652  cima 5654  Oncon0 6349  cfv 6525   |s ccuts 27906   M cmade 27969   O cold 27970   N cnew 27971
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pr 5394  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6291  df-ord 6352  df-on 6353  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-made 27974  df-new 27976
This theorem is referenced by:  new0  28011  madeun  28031  newbday  28049
  Copyright terms: Public domain W3C validator