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

Theorem msrfval 35542
Description: Value of the reduct of a pre-statement. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
msrfval.v 𝑉 = (mVars‘𝑇)
msrfval.p 𝑃 = (mPreSt‘𝑇)
msrfval.r 𝑅 = (mStRed‘𝑇)
Assertion
Ref Expression
msrfval 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
Distinct variable groups:   ,𝑎,𝑠,𝑧,𝑃   𝑇,𝑎,,𝑠   𝑧,𝑉
Allowed substitution hints:   𝑅(𝑧,,𝑠,𝑎)   𝑇(𝑧)   𝑉(,𝑠,𝑎)

Proof of Theorem msrfval
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 msrfval.r . 2 𝑅 = (mStRed‘𝑇)
2 fveq2 6906 . . . . . 6 (𝑡 = 𝑇 → (mPreSt‘𝑡) = (mPreSt‘𝑇))
3 msrfval.p . . . . . 6 𝑃 = (mPreSt‘𝑇)
42, 3eqtr4di 2795 . . . . 5 (𝑡 = 𝑇 → (mPreSt‘𝑡) = 𝑃)
5 fveq2 6906 . . . . . . . . . . . . 13 (𝑡 = 𝑇 → (mVars‘𝑡) = (mVars‘𝑇))
6 msrfval.v . . . . . . . . . . . . 13 𝑉 = (mVars‘𝑇)
75, 6eqtr4di 2795 . . . . . . . . . . . 12 (𝑡 = 𝑇 → (mVars‘𝑡) = 𝑉)
87imaeq1d 6077 . . . . . . . . . . 11 (𝑡 = 𝑇 → ((mVars‘𝑡) “ ( ∪ {𝑎})) = (𝑉 “ ( ∪ {𝑎})))
98unieqd 4920 . . . . . . . . . 10 (𝑡 = 𝑇 ((mVars‘𝑡) “ ( ∪ {𝑎})) = (𝑉 “ ( ∪ {𝑎})))
109csbeq1d 3903 . . . . . . . . 9 (𝑡 = 𝑇 ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧) = (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧))
1110ineq2d 4220 . . . . . . . 8 (𝑡 = 𝑇 → ((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)) = ((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)))
1211oteq1d 4885 . . . . . . 7 (𝑡 = 𝑇 → ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ = ⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
1312csbeq2dv 3906 . . . . . 6 (𝑡 = 𝑇(2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ = (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
1413csbeq2dv 3906 . . . . 5 (𝑡 = 𝑇(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ = (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
154, 14mpteq12dv 5233 . . . 4 (𝑡 = 𝑇 → (𝑠 ∈ (mPreSt‘𝑡) ↦ (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩) = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩))
16 df-msr 35499 . . . 4 mStRed = (𝑡 ∈ V ↦ (𝑠 ∈ (mPreSt‘𝑡) ↦ (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑡) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩))
1715, 16, 3mptfvmpt 7248 . . 3 (𝑇 ∈ V → (mStRed‘𝑇) = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩))
18 mpt0 6710 . . . . 5 (𝑠 ∈ ∅ ↦ (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩) = ∅
1918eqcomi 2746 . . . 4 ∅ = (𝑠 ∈ ∅ ↦ (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
20 fvprc 6898 . . . 4 𝑇 ∈ V → (mStRed‘𝑇) = ∅)
21 fvprc 6898 . . . . . 6 𝑇 ∈ V → (mPreSt‘𝑇) = ∅)
223, 21eqtrid 2789 . . . . 5 𝑇 ∈ V → 𝑃 = ∅)
2322mpteq1d 5237 . . . 4 𝑇 ∈ V → (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩) = (𝑠 ∈ ∅ ↦ (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩))
2419, 20, 233eqtr4a 2803 . . 3 𝑇 ∈ V → (mStRed‘𝑇) = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩))
2517, 24pm2.61i 182 . 2 (mStRed‘𝑇) = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
261, 25eqtri 2765 1 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ (𝑉 “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1540  wcel 2108  Vcvv 3480  csb 3899  cun 3949  cin 3950  c0 4333  {csn 4626  cotp 4634   cuni 4907  cmpt 5225   × cxp 5683  cima 5688  cfv 6561  1st c1st 8012  2nd c2nd 8013  mVarscmvrs 35474  mPreStcmpst 35478  mStRedcmsr 35479
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-ot 4635  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-msr 35499
This theorem is referenced by:  msrval  35543  msrf  35547
  Copyright terms: Public domain W3C validator