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 36073
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 5449 . . . . 5 ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
21csbex 5276 . . . 4 (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
32csbex 5276 . . 3 (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
4 eqid 2765 . . . 4 (mVars‘𝑇) = (mVars‘𝑇)
5 mpstssv.p . . . 4 𝑃 = (mPreSt‘𝑇)
6 msrf.r . . . 4 𝑅 = (mStRed‘𝑇)
74, 5, 6msrfval 36068 . . 3 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
83, 7fnmpti 6682 . 2 𝑅 Fn 𝑃
95mpst123 36071 . . . . . 6 (𝑠𝑃𝑠 = ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
109fveq2d 6889 . . . . 5 (𝑠𝑃 → (𝑅𝑠) = (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩))
11 id 23 . . . . . . 7 (𝑠𝑃𝑠𝑃)
129, 11eqeltrrd 2866 . . . . . 6 (𝑠𝑃 → ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
13 eqid 2765 . . . . . . 7 ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) = ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))
144, 5, 6, 13msrval 36069 . . . . . 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 18 . . . . 5 (𝑠𝑃 → (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
1610, 15eqtrd 2800 . . . 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 2765 . . . . . . . . . . 11 (mDV‘𝑇) = (mDV‘𝑇)
19 eqid 2765 . . . . . . . . . . 11 (mEx‘𝑇) = (mEx‘𝑇)
2018, 19, 5elmpst 36067 . . . . . . . . . 10 (⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃 ↔ (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2112, 20sylib 221 . . . . . . . . 9 (𝑠𝑃 → (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2221simp1d 1160 . . . . . . . 8 (𝑠𝑃 → ((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))))
2322simpld 500 . . . . . . 7 (𝑠𝑃 → (1st ‘(1st𝑠)) ⊆ (mDV‘𝑇))
2417, 23sstrid 3949 . . . . . 6 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇))
25 cnvin 6143 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))))
2622simprd 501 . . . . . . . 8 (𝑠𝑃(1st ‘(1st𝑠)) = (1st ‘(1st𝑠)))
27 cnvxp 6156 . . . . . . . . 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 4174 . . . . . . 7 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3025, 29eqtrid 2812 . . . . . 6 (𝑠𝑃((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3124, 30jca 521 . . . . 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 1161 . . . . 5 (𝑠𝑃 → ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin))
3321simp3d 1162 . . . . 5 (𝑠𝑃 → (2nd𝑠) ∈ (mEx‘𝑇))
3418, 19, 5elmpst 36067 . . . . 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 1362 . . . 4 (𝑠𝑃 → ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
3616, 35eqeltrd 2865 . . 3 (𝑠𝑃 → (𝑅𝑠) ∈ 𝑃)
3736rgen 3083 . 2 𝑠𝑃 (𝑅𝑠) ∈ 𝑃
38 ffnfv 7118 . 2 (𝑅:𝑃𝑃 ↔ (𝑅 Fn 𝑃 ∧ ∀𝑠𝑃 (𝑅𝑠) ∈ 𝑃))
398, 37, 38mpbir2an 724 1 𝑅:𝑃𝑃
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3081  csb 3854  cun 3904  cin 3905  wss 3906  {csn 4591  cotp 4599   cuni 4874   × cxp 5661  ccnv 5662  cima 5666   Fn wfn 6535  wf 6536  cfv 6540  1st c1st 7990  2nd c2nd 7991  Fincfn 8949  mExcmex 35998  mDVcmdv 35999  mVarscmvrs 36000  mPreStcmpst 36004  mStRedcmsr 36005
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-1st 7992  df-2nd 7993  df-mpst 36024  df-msr 36025
This theorem is used by:  msrrcl  36074  msrid  36076  msrfo  36077  mstapst  36078  elmsta  36079  elmthm  36107  mthmsta  36109  mthmblem  36111
  Copyright terms: Public domain W3C validator