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

Theorem msrf 35736
Description: The reduct of a pre-statement is a pre-statement. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mpstssv.p 𝑃 = (mPreSt‘𝑇)
msrf.r 𝑅 = (mStRed‘𝑇)
Assertion
Ref Expression
msrf 𝑅:𝑃𝑃

Proof of Theorem msrf
Dummy variables 𝑎 𝑠 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 otex 5413 . . . . 5 ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
21csbex 5256 . . . 4 (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
32csbex 5256 . . 3 (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
4 eqid 2736 . . . 4 (mVars‘𝑇) = (mVars‘𝑇)
5 mpstssv.p . . . 4 𝑃 = (mPreSt‘𝑇)
6 msrf.r . . . 4 𝑅 = (mStRed‘𝑇)
74, 5, 6msrfval 35731 . . 3 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
83, 7fnmpti 6635 . 2 𝑅 Fn 𝑃
95mpst123 35734 . . . . . 6 (𝑠𝑃𝑠 = ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
109fveq2d 6838 . . . . 5 (𝑠𝑃 → (𝑅𝑠) = (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩))
11 id 22 . . . . . . 7 (𝑠𝑃𝑠𝑃)
129, 11eqeltrrd 2837 . . . . . 6 (𝑠𝑃 → ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
13 eqid 2736 . . . . . . 7 ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) = ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))
144, 5, 6, 13msrval 35732 . . . . . 6 (⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃 → (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
1512, 14syl 17 . . . . 5 (𝑠𝑃 → (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
1610, 15eqtrd 2771 . . . 4 (𝑠𝑃 → (𝑅𝑠) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
17 inss1 4189 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (1st ‘(1st𝑠))
18 eqid 2736 . . . . . . . . . . 11 (mDV‘𝑇) = (mDV‘𝑇)
19 eqid 2736 . . . . . . . . . . 11 (mEx‘𝑇) = (mEx‘𝑇)
2018, 19, 5elmpst 35730 . . . . . . . . . 10 (⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃 ↔ (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2112, 20sylib 218 . . . . . . . . 9 (𝑠𝑃 → (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2221simp1d 1142 . . . . . . . 8 (𝑠𝑃 → ((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))))
2322simpld 494 . . . . . . 7 (𝑠𝑃 → (1st ‘(1st𝑠)) ⊆ (mDV‘𝑇))
2417, 23sstrid 3945 . . . . . 6 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇))
25 cnvin 6102 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))))
2622simprd 495 . . . . . . . 8 (𝑠𝑃(1st ‘(1st𝑠)) = (1st ‘(1st𝑠)))
27 cnvxp 6115 . . . . . . . . 9 ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))) = ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))
2827a1i 11 . . . . . . . 8 (𝑠𝑃( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))) = ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))))
2926, 28ineq12d 4173 . . . . . . 7 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3025, 29eqtrid 2783 . . . . . 6 (𝑠𝑃((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3124, 30jca 511 . . . . 5 (𝑠𝑃 → (((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇) ∧ ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))))))
3221simp2d 1143 . . . . 5 (𝑠𝑃 → ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin))
3321simp3d 1144 . . . . 5 (𝑠𝑃 → (2nd𝑠) ∈ (mEx‘𝑇))
3418, 19, 5elmpst 35730 . . . . 5 (⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃 ↔ ((((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇) ∧ ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
3531, 32, 33, 34syl3anbrc 1344 . . . 4 (𝑠𝑃 → ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
3616, 35eqeltrd 2836 . . 3 (𝑠𝑃 → (𝑅𝑠) ∈ 𝑃)
3736rgen 3053 . 2 𝑠𝑃 (𝑅𝑠) ∈ 𝑃
38 ffnfv 7064 . 2 (𝑅:𝑃𝑃 ↔ (𝑅 Fn 𝑃 ∧ ∀𝑠𝑃 (𝑅𝑠) ∈ 𝑃))
398, 37, 38mpbir2an 711 1 𝑅:𝑃𝑃
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3051  csb 3849  cun 3899  cin 3900  wss 3901  {csn 4580  cotp 4588   cuni 4863   × cxp 5622  ccnv 5623  cima 5627   Fn wfn 6487  wf 6488  cfv 6492  1st c1st 7931  2nd c2nd 7932  Fincfn 8883  mExcmex 35661  mDVcmdv 35662  mVarscmvrs 35663  mPreStcmpst 35667  mStRedcmsr 35668
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-ot 4589  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-1st 7933  df-2nd 7934  df-mpst 35687  df-msr 35688
This theorem is referenced by:  msrrcl  35737  msrid  35739  msrfo  35740  mstapst  35741  elmsta  35742  elmthm  35770  mthmsta  35772  mthmblem  35774
  Copyright terms: Public domain W3C validator