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 36122
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 5441 . . . . 5 ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
21csbex 5268 . . . 4 (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
32csbex 5268 . . 3 (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
4 eqid 2760 . . . 4 (mVars‘𝑇) = (mVars‘𝑇)
5 mpstssv.p . . . 4 𝑃 = (mPreSt‘𝑇)
6 msrf.r . . . 4 𝑅 = (mStRed‘𝑇)
74, 5, 6msrfval 36117 . . 3 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
83, 7fnmpti 6676 . 2 𝑅 Fn 𝑃
95mpst123 36120 . . . . . 6 (𝑠𝑃𝑠 = ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
109fveq2d 6883 . . . . 5 (𝑠𝑃 → (𝑅𝑠) = (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩))
11 id 23 . . . . . . 7 (𝑠𝑃𝑠𝑃)
129, 11eqeltrrd 2861 . . . . . 6 (𝑠𝑃 → ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
13 eqid 2760 . . . . . . 7 ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) = ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))
144, 5, 6, 13msrval 36118 . . . . . 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 2795 . . . 4 (𝑠𝑃 → (𝑅𝑠) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
17 inss1 4182 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (1st ‘(1st𝑠))
18 eqid 2760 . . . . . . . . . . 11 (mDV‘𝑇) = (mDV‘𝑇)
19 eqid 2760 . . . . . . . . . . 11 (mEx‘𝑇) = (mEx‘𝑇)
2018, 19, 5elmpst 36116 . . . . . . . . . 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 3942 . . . . . 6 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇))
25 cnvin 6135 . . . . . . 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 6148 . . . . . . . . 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 4167 . . . . . . 7 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3025, 29eqtrid 2807 . . . . . 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 36116 . . . . 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 2860 . . 3 (𝑠𝑃 → (𝑅𝑠) ∈ 𝑃)
3736rgen 3078 . 2 𝑠𝑃 (𝑅𝑠) ∈ 𝑃
38 ffnfv 7113 . 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 2145  wral 3076  csb 3847  cun 3897  cin 3898  wss 3899  {csn 4584  cotp 4592   cuni 4867   × cxp 5653  ccnv 5654  cima 5658   Fn wfn 6528  wf 6529  cfv 6533  1st c1st 7985  2nd c2nd 7986  Fincfn 8953  mExcmex 36047  mDVcmdv 36048  mVarscmvrs 36049  mPreStcmpst 36053  mStRedcmsr 36054
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-ot 4593  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-1st 7987  df-2nd 7988  df-mpst 36073  df-msr 36074
This theorem is used by:  msrrcl  36123  msrid  36125  msrfo  36126  mstapst  36127  elmsta  36128  elmthm  36156  mthmsta  36158  mthmblem  36160
  Copyright terms: Public domain W3C validator