Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mrsubffval Structured version   Visualization version   GIF version

Theorem mrsubffval 36241
Description: The substitution of some variables for expressions in a raw expression. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mrsubffval.c 𝐶 = (mCN‘𝑇)
mrsubffval.v 𝑉 = (mVR‘𝑇)
mrsubffval.r 𝑅 = (mREx‘𝑇)
mrsubffval.s 𝑆 = (mRSubst‘𝑇)
mrsubffval.g 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
Assertion
Ref Expression
mrsubffval (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
Distinct variable groups:   𝑒,𝑓,𝑣,𝐶   𝑅,𝑒,𝑓,𝑣   𝑒,𝐺,𝑓   𝑇,𝑒,𝑓,𝑣   𝑒,𝑉,𝑓,𝑣
Allowed substitution hints:   𝑆(𝑣, 𝑒, 𝑓)   𝐺(𝑣)   𝑊(𝑣, 𝑒, 𝑓)

Proof of Theorem mrsubffval
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 mrsubffval.s . 2 𝑆 = (mRSubst‘𝑇)
2 elex 3472 . . 3 (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
3 fveq2 6877 . . . . . . 7 (𝑡 = 𝑇 → (mREx‘𝑡) = (mREx‘𝑇))
4 mrsubffval.r . . . . . . 7 𝑅 = (mREx‘𝑇)
53, 4eqtr4di 2814 . . . . . 6 (𝑡 = 𝑇 → (mREx‘𝑡) = 𝑅)
6 fveq2 6877 . . . . . . 7 (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
7 mrsubffval.v . . . . . . 7 𝑉 = (mVR‘𝑇)
86, 7eqtr4di 2814 . . . . . 6 (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
95, 8oveq12d 7430 . . . . 5 (𝑡 = 𝑇 → ((mREx‘𝑡) ↑pm (mVR‘𝑡)) = (𝑅 ↑pm 𝑉))
10 fveq2 6877 . . . . . . . . . . 11 (𝑡 = 𝑇 → (mCN‘𝑡) = (mCN‘𝑇))
11 mrsubffval.c . . . . . . . . . . 11 𝐶 = (mCN‘𝑇)
1210, 11eqtr4di 2814 . . . . . . . . . 10 (𝑡 = 𝑇 → (mCN‘𝑡) = 𝐶)
1312, 8uneq12d 4116 . . . . . . . . 9 (𝑡 = 𝑇 → ((mCN‘𝑡) ∪ (mVR‘𝑡)) = (𝐶 ∪ 𝑉))
1413fveq2d 6881 . . . . . . . 8 (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = (freeMnd‘(𝐶 ∪ 𝑉)))
15 mrsubffval.g . . . . . . . 8 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
1614, 15eqtr4di 2814 . . . . . . 7 (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = 𝐺)
1713mpteq1d 5195 . . . . . . . 8 (𝑡 = 𝑇 → (𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)))
1817coeq1d 5839 . . . . . . 7 (𝑡 = 𝑇 → ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
1916, 18oveq12d 7430 . . . . . 6 (𝑡 = 𝑇 → ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
205, 19mpteq12dv 5192 . . . . 5 (𝑡 = 𝑇 → (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
219, 20mpteq12dv 5192 . . . 4 (𝑡 = 𝑇 → (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
22 df-mrsub 36224 . . . 4 mRSubst = (𝑡 ∈ V ↦ (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
23 ovex 7445 . . . . 5 (𝑅 ↑pm 𝑉) ∈ V
2423mptex 7221 . . . 4 (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) ∈ V
2521, 22, 24fvmpt 6985 . . 3 (𝑇 ∈ V → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
262, 25syl 18 . 2 (𝑇 ∈ 𝑊 → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
271, 26eqtrid 2808 1 (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897  ifcif 4482   ↦ cmpt 5186  dom cdm 5651   ∘ ccom 5655  ‘cfv 6531  (class class class)co 7412   ↑pm cpm 8832  ⟨“cs1 14722   Σg cgsu 17591  freeMndcfrmd 19023  mCNcmcn 36194  mVRcmvar 36195  mRExcmrex 36200  mRSubstcmrsub 36204
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nul 4280  df-if 4483  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-id 5546  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-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-mrsub 36224
This theorem is used by:  mrsubfval  36242  mrsubff  36246
  Copyright terms: Public domain W3C validator