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 36453
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 36452 . . . . 5 (𝑇 ∈ V → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
76adantr 486 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑆 = (𝑓 ∈ (𝑅 ↑pm 𝑉) ↦ (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
8 dmeq 5893 . . . . . . . . . . 11 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
9 fdm 6744 . . . . . . . . . . . 12 (𝐹:𝐴⟶𝑅 → dom 𝐹 = 𝐴)
109ad2antrl 741 . . . . . . . . . . 11 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → dom 𝐹 = 𝐴)
118, 10sylan9eqr 2820 . . . . . . . . . 10 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
1211eleq2d 2850 . . . . . . . . 9 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ dom 𝑓 ↔ 𝑣 ∈ 𝐴))
13 simpr 490 . . . . . . . . . 10 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
1413fveq1d 6913 . . . . . . . . 9 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑓‘𝑣) = (𝐹‘𝑣))
1512, 14ifbieq1d 4510 . . . . . . . 8 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩) = if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩))
1615mpteq2dv 5203 . . . . . . 7 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) = (𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)))
1716coeq1d 5846 . . . . . 6 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒) = ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))
1817oveq2d 7462 . . . . 5 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)) = (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))
1918mpteq2dv 5203 . . . 4 (((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) ∧ 𝑓 = 𝐹) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ dom 𝑓, (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
203fvexi 6925 . . . . . 6 𝑅 ∈ V
2120a1i 11 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑅 ∈ V)
222fvexi 6925 . . . . . 6 𝑉 ∈ V
2322a1i 11 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝑉 ∈ V)
24 simprl 783 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹:𝐴⟶𝑅)
25 simprr 785 . . . . 5 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐴 ⊆ 𝑉)
26 elpm2r 8896 . . . . 5 (((𝑅 ∈ V ∧ 𝑉 ∈ V) ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
2721, 23, 24, 25, 26syl22anc 852 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → 𝐹 ∈ (𝑅 ↑pm 𝑉))
2820mptex 7255 . . . . 5 (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V
2928a1i 11 . . . 4 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) ∈ V)
307, 19, 27, 29fvmptd 7027 . . 3 ((𝑇 ∈ V ∧ (𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉)) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
3130ex 418 . 2 (𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
32 0fv 6952 . . . 4 (∅‘𝐹) = ∅
33 fvprc 6903 . . . . . 6 (¬ 𝑇 ∈ V → (mRSubst‘𝑇) = ∅)
344, 33eqtrid 2810 . . . . 5 (¬ 𝑇 ∈ V → 𝑆 = ∅)
3534fveq1d 6913 . . . 4 (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (∅‘𝐹))
36 fvprc 6903 . . . . . . 7 (¬ 𝑇 ∈ V → (mREx‘𝑇) = ∅)
373, 36eqtrid 2810 . . . . . 6 (¬ 𝑇 ∈ V → 𝑅 = ∅)
3837mpteq1d 5199 . . . . 5 (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
39 mpt0 6706 . . . . 5 (𝑒 ∈ ∅ ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅
4038, 39eqtrdi 2814 . . . 4 (¬ 𝑇 ∈ V → (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))) = ∅)
4132, 35, 403eqtr4a 2824 . . 3 (¬ 𝑇 ∈ V → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
4241a1d 26 . 2 (¬ 𝑇 ∈ V → ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒)))))
4331, 42pm2.61i 184 1 ((𝐹:𝐴⟶𝑅 ∧ 𝐴 ⊆ 𝑉) → (𝑆‘𝐹) = (𝑒 ∈ 𝑅 ↦ (𝐺 Σg ((𝑣 ∈ (𝐶 ∪ 𝑉) ↦ if(𝑣 ∈ 𝐴, (𝐹‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑒))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  ifcif 4485   ↦ cmpt 5190  dom cdm 5656   ∘ ccom 5660  ⟶wf 6557  ‘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-pow 5332  ax-pr 5396  ax-un 7778
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-pw 4562  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-oprab 7450  df-mpo 7451  df-pm 8881  df-mrsub 36435
This theorem is used by:  mrsubval  36454  mrsubrn  36458  elmrsubrn  36465
  Copyright terms: Public domain W3C validator