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

Theorem mrsubfval 31743
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
mrsubfval ((𝐹:𝐴𝑅𝐴𝑉) → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
Distinct variable groups:   𝑣,𝑒,𝐴   𝐶,𝑒,𝑣   𝑒,𝐹,𝑣   𝑅,𝑒,𝑣   𝑒,𝐺   𝑇,𝑒,𝑣   𝑒,𝑉,𝑣
Allowed substitution hints:   𝑆(𝑣,𝑒)   𝐺(𝑣)

Proof of Theorem mrsubfval
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 mrsubffval.c . . . . . 6 𝐶 = (mCN‘𝑇)
2 mrsubffval.v . . . . . 6 𝑉 = (mVR‘𝑇)
3 mrsubffval.r . . . . . 6 𝑅 = (mREx‘𝑇)
4 mrsubffval.s . . . . . 6 𝑆 = (mRSubst‘𝑇)
5 mrsubffval.g . . . . . 6 𝐺 = (freeMnd‘(𝐶𝑉))
61, 2, 3, 4, 5mrsubffval 31742 . . . . 5 (𝑇 ∈ V → 𝑆 = (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
76adantr 466 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝑆 = (𝑓 ∈ (𝑅pm 𝑉) ↦ (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
8 dmeq 5462 . . . . . . . . . . 11 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
9 fdm 6191 . . . . . . . . . . . 12 (𝐹:𝐴𝑅 → dom 𝐹 = 𝐴)
109ad2antrl 707 . . . . . . . . . . 11 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → dom 𝐹 = 𝐴)
118, 10sylan9eqr 2827 . . . . . . . . . 10 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
1211eleq2d 2836 . . . . . . . . 9 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ dom 𝑓𝑣𝐴))
13 simpr 471 . . . . . . . . . 10 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
1413fveq1d 6334 . . . . . . . . 9 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → (𝑓𝑣) = (𝐹𝑣))
1512, 14ifbieq1d 4248 . . . . . . . 8 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩) = if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩))
1615mpteq2dv 4879 . . . . . . 7 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)))
1716coeq1d 5422 . . . . . 6 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
1817oveq2d 6809 . . . . 5 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
1918mpteq2dv 4879 . . . 4 (((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) ∧ 𝑓 = 𝐹) → (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
20 fvex 6342 . . . . . . 7 (mREx‘𝑇) ∈ V
213, 20eqeltri 2846 . . . . . 6 𝑅 ∈ V
2221a1i 11 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝑅 ∈ V)
23 fvex 6342 . . . . . . 7 (mVR‘𝑇) ∈ V
242, 23eqeltri 2846 . . . . . 6 𝑉 ∈ V
2524a1i 11 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝑉 ∈ V)
26 simprl 754 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝐹:𝐴𝑅)
27 simprr 756 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝐴𝑉)
28 elpm2r 8027 . . . . 5 (((𝑅 ∈ V ∧ 𝑉 ∈ V) ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝐹 ∈ (𝑅pm 𝑉))
2922, 25, 26, 27, 28syl22anc 1477 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → 𝐹 ∈ (𝑅pm 𝑉))
3021mptex 6630 . . . . 5 (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V
3130a1i 11 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V)
327, 19, 29, 31fvmptd 6430 . . 3 ((𝑇 ∈ V ∧ (𝐹:𝐴𝑅𝐴𝑉)) → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
3332ex 397 . 2 (𝑇 ∈ V → ((𝐹:𝐴𝑅𝐴𝑉) → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
34 0fv 6368 . . . 4 (∅‘𝐹) = ∅
35 fvprc 6326 . . . . . 6 𝑇 ∈ V → (mRSubst‘𝑇) = ∅)
364, 35syl5eq 2817 . . . . 5 𝑇 ∈ V → 𝑆 = ∅)
3736fveq1d 6334 . . . 4 𝑇 ∈ V → (𝑆𝐹) = (∅‘𝐹))
38 fvprc 6326 . . . . . . 7 𝑇 ∈ V → (mREx‘𝑇) = ∅)
393, 38syl5eq 2817 . . . . . 6 𝑇 ∈ V → 𝑅 = ∅)
4039mpteq1d 4872 . . . . 5 𝑇 ∈ V → (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
41 mpt0 6161 . . . . 5 (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅
4240, 41syl6eq 2821 . . . 4 𝑇 ∈ V → (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅)
4334, 37, 423eqtr4a 2831 . . 3 𝑇 ∈ V → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
4443a1d 25 . 2 𝑇 ∈ V → ((𝐹:𝐴𝑅𝐴𝑉) → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
4533, 44pm2.61i 176 1 ((𝐹:𝐴𝑅𝐴𝑉) → (𝑆𝐹) = (𝑒𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶𝑉) ↦ if(𝑣𝐴, (𝐹𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382   = wceq 1631  wcel 2145  Vcvv 3351  cun 3721  wss 3723  c0 4063  ifcif 4225  cmpt 4863  dom cdm 5249  ccom 5253  wf 6027  cfv 6031  (class class class)co 6793  pm cpm 8010  ⟨“cs1 13490   Σg cgsu 16309  freeMndcfrmd 17592  mCNcmcn 31695  mVRcmvar 31696  mRExcmrex 31701  mRSubstcmrsub 31705
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-rep 4904  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-pm 8012  df-mrsub 31725
This theorem is referenced by:  mrsubval  31744  mrsubrn  31748  elmrsubrn  31755
  Copyright terms: Public domain W3C validator