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

Theorem newval 28203
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 6877 . . . 4 (𝑥 = 𝐴 → ( M ‘𝑥) = ( M ‘𝐴))
2 fveq2 6877 . . . 4 (𝑥 = 𝐴 → ( O ‘𝑥) = ( O ‘𝐴))
31, 2difeq12d 4075 . . 3 (𝑥 = 𝐴 → (( M ‘𝑥) ∖ ( O ‘𝑥)) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
4 df-new 28197 . . 3 N = (𝑥 ∈ On ↦ (( M ‘𝑥) ∖ ( O ‘𝑥)))
5 fvex 6890 . . . 4 ( M ‘𝐴) ∈ V
65difexi 5292 . . 3 (( M ‘𝐴) ∖ ( O ‘𝐴)) ∈ V
73, 4, 6fvmpt 6985 . 2 (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
84fvmptndm 7017 . . 3 (¬ 𝐴 ∈ On → ( N ‘𝐴) = ∅)
9 df-made 28195 . . . . . . . . 9 M = recs((𝑓 ∈ V ↦ ( |s “ (𝒫 ∪ ran 𝑓 × 𝒫 ∪ ran 𝑓))))
109tfr1 8389 . . . . . . . 8 M Fn On
1110fndmi 6635 . . . . . . 7 dom M = On
1211eleq2i 2853 . . . . . 6 (𝐴 ∈ dom M ↔ 𝐴 ∈ On)
13 ndmfv 6909 . . . . . 6 (¬ 𝐴 ∈ dom M → ( M ‘𝐴) = ∅)
1412, 13sylnbir 334 . . . . 5 (¬ 𝐴 ∈ On → ( M ‘𝐴) = ∅)
1514difeq1d 4073 . . . 4 (¬ 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = (∅ ∖ ( O ‘𝐴)))
16 0dif 4356 . . . 4 (∅ ∖ ( O ‘𝐴)) = ∅
1715, 16eqtrdi 2812 . . 3 (¬ 𝐴 ∈ On → (( M ‘𝐴) ∖ ( O ‘𝐴)) = ∅)
188, 17eqtr4d 2799 . 2 (¬ 𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)))
197, 18pm2.61i 184 1 ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867   ↦ cmpt 5186   × cxp 5649  dom cdm 5651  ran crn 5652   “ cima 5654  Oncon0 6355  ‘cfv 6531   |s ccuts 28127   M cmade 28190   O cold 28191   N cnew 28192
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6297  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-made 28195  df-new 28197
This theorem is used by:  new0  28232  madeun  28252  newbday  28270
  Copyright terms: Public domain W3C validator