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

Theorem newval 27797
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 6822 . . . 4 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
2 fveq2 6822 . . . 4 (𝑥 = 𝐴 → ( O ‘𝑥) = ( O ‘𝐴))
31, 2difeq12d 4077 . . 3 (𝑥 = 𝐴 → (( M ‘𝑥) ∖ ( O ‘𝑥)) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
4 df-new 27791 . . 3 N = (𝑥 ∈ On ↦ (( M ‘𝑥) ∖ ( O ‘𝑥)))
5 fvex 6835 . . . 4 ( M ‘𝐴) ∈ V
65difexi 5268 . . 3 (( M ‘𝐴) ∖ ( O ‘𝐴)) ∈ V
73, 4, 6fvmpt 6929 . 2 (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
84fvmptndm 6960 . . 3 𝐴 ∈ On → ( N ‘𝐴) = ∅)
9 df-made 27789 . . . . . . . . 9 M = recs((𝑓 ∈ V ↦ ( |s “ (𝒫 ran 𝑓 × 𝒫 ran 𝑓))))
109tfr1 8316 . . . . . . . 8 M Fn On
1110fndmi 6585 . . . . . . 7 dom M = On
1211eleq2i 2823 . . . . . 6 (𝐴 ∈ dom M ↔ 𝐴 ∈ On)
13 ndmfv 6854 . . . . . 6 𝐴 ∈ dom M → ( M ‘𝐴) = ∅)
1412, 13sylnbir 331 . . . . 5 𝐴 ∈ On → ( M ‘𝐴) = ∅)
1514difeq1d 4075 . . . 4 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = (∅ ∖ ( O ‘𝐴)))
16 0dif 4355 . . . 4 (∅ ∖ ( O ‘𝐴)) = ∅
1715, 16eqtrdi 2782 . . 3 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = ∅)
188, 17eqtr4d 2769 . 2 𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
197, 18pm2.61i 182 1 ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1541  wcel 2111  Vcvv 3436  cdif 3899  c0 4283  𝒫 cpw 4550   cuni 4859  cmpt 5172   × cxp 5614  dom cdm 5616  ran crn 5617  cima 5619  Oncon0 6306  cfv 6481   |s cscut 27723   M cmade 27784   O cold 27785   N cnew 27786
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-made 27789  df-new 27791
This theorem is referenced by:  new0  27820  madeun  27830  newbday  27848
  Copyright terms: Public domain W3C validator