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 36452
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 3475 . . 3 (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
3 fveq2 6911 . . . . . . 7 (𝑡 = 𝑇 → (mREx‘𝑡) = (mREx‘𝑇))
4 mrsubffval.r . . . . . . 7 𝑅 = (mREx‘𝑇)
53, 4eqtr4di 2816 . . . . . 6 (𝑡 = 𝑇 → (mREx‘𝑡) = 𝑅)
6 fveq2 6911 . . . . . . 7 (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
7 mrsubffval.v . . . . . . 7 𝑉 = (mVR‘𝑇)
86, 7eqtr4di 2816 . . . . . 6 (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
95, 8oveq12d 7464 . . . . 5 (𝑡 = 𝑇 → ((mREx‘𝑡) ↑pm (mVR‘𝑡)) = (𝑅 ↑pm 𝑉))
10 fveq2 6911 . . . . . . . . . . 11 (𝑡 = 𝑇 → (mCN‘𝑡) = (mCN‘𝑇))
11 mrsubffval.c . . . . . . . . . . 11 𝐶 = (mCN‘𝑇)
1210, 11eqtr4di 2816 . . . . . . . . . 10 (𝑡 = 𝑇 → (mCN‘𝑡) = 𝐶)
1312, 8uneq12d 4171 . . . . . . . . 9 (𝑡 = 𝑇 → ((mCN‘𝑡) ∪ (mVR‘𝑡)) = (𝐶 ∪ 𝑉))
1413fveq2d 6915 . . . . . . . 8 (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = (freeMnd‘(𝐶 ∪ 𝑉)))
15 mrsubffval.g . . . . . . . 8 𝐺 = (freeMnd‘(𝐶 ∪ 𝑉))
1614, 15eqtr4di 2816 . . . . . . 7 (𝑡 = 𝑇 → (freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) = 𝐺)
1713mpteq1d 5199 . . . . . . . 8 (𝑡 = 𝑇 → (𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)))
1817coeq1d 5846 . . . . . . 7 (𝑡 = 𝑇 → ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
1916, 18oveq12d 7464 . . . . . 6 (𝑡 = 𝑇 → ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
205, 19mpteq12dv 5196 . . . . 5 (𝑡 = 𝑇 → (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
219, 20mpteq12dv 5196 . . . 4 (𝑡 = 𝑇 → (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
22 df-mrsub 36435 . . . 4 mRSubst = (𝑡 ∈ V ↦ (𝑓 ∈ ((mREx‘𝑡) ↑pm (mVR‘𝑡)) ↦ (𝑒 ∈ (mREx‘𝑡) ↦ ((freeMnd‘((mCN‘𝑡) ∪ (mVR‘𝑡))) Σg ((𝑣 ∈ ((mCN‘𝑡) ∪ (mVR‘𝑡)) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
23 ovex 7479 . . . . 5 (𝑅 ↑pm 𝑉) ∈ V
2423mptex 7255 . . . 4 (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))) ∈ V
2521, 22, 24fvmpt 7019 . . 3 (𝑇 ∈ V → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
262, 25syl 18 . 2 (𝑇 ∈ 𝑊 → (mRSubst‘𝑇) = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
271, 26eqtrid 2810 1 (𝑇 ∈ 𝑊 → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  ifcif 4485   ↦ cmpt 5190  dom cdm 5656   ∘ ccom 5660  ‘cfv 6561  (class class class)co 7446   ↑pm cpm 8879  ⟨“cs1 14772   Σg cgsu 17643  freeMndcfrmd 19075  mCNcmcn 36405  mVRcmvar 36406  mRExcmrex 36411  mRSubstcmrsub 36415
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-mrsub 36435
This theorem is used by:  mrsubfval  36453  mrsubff  36457
  Copyright terms: Public domain W3C validator