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 35142
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 5461 . . . . 5 ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
21csbex 5305 . . . 4 (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
32csbex 5305 . . 3 (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
4 eqid 2727 . . . 4 (mVars‘𝑇) = (mVars‘𝑇)
5 mpstssv.p . . . 4 𝑃 = (mPreSt‘𝑇)
6 msrf.r . . . 4 𝑅 = (mStRed‘𝑇)
74, 5, 6msrfval 35137 . . 3 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
83, 7fnmpti 6692 . 2 𝑅 Fn 𝑃
95mpst123 35140 . . . . . 6 (𝑠𝑃𝑠 = ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
109fveq2d 6895 . . . . 5 (𝑠𝑃 → (𝑅𝑠) = (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩))
11 id 22 . . . . . . 7 (𝑠𝑃𝑠𝑃)
129, 11eqeltrrd 2829 . . . . . 6 (𝑠𝑃 → ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
13 eqid 2727 . . . . . . 7 ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) = ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))
144, 5, 6, 13msrval 35138 . . . . . 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 2767 . . . 4 (𝑠𝑃 → (𝑅𝑠) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
17 inss1 4224 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (1st ‘(1st𝑠))
18 eqid 2727 . . . . . . . . . . 11 (mDV‘𝑇) = (mDV‘𝑇)
19 eqid 2727 . . . . . . . . . . 11 (mEx‘𝑇) = (mEx‘𝑇)
2018, 19, 5elmpst 35136 . . . . . . . . . 10 (⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃 ↔ (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2112, 20sylib 217 . . . . . . . . 9 (𝑠𝑃 → (((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))) ∧ ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin) ∧ (2nd𝑠) ∈ (mEx‘𝑇)))
2221simp1d 1140 . . . . . . . 8 (𝑠𝑃 → ((1st ‘(1st𝑠)) ⊆ (mDV‘𝑇) ∧ (1st ‘(1st𝑠)) = (1st ‘(1st𝑠))))
2322simpld 494 . . . . . . 7 (𝑠𝑃 → (1st ‘(1st𝑠)) ⊆ (mDV‘𝑇))
2417, 23sstrid 3989 . . . . . 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 495 . . . . . . . 8 (𝑠𝑃(1st ‘(1st𝑠)) = (1st ‘(1st𝑠)))
27 cnvxp 6155 . . . . . . . . 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 4209 . . . . . . 7 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3025, 29eqtrid 2779 . . . . . 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 1141 . . . . 5 (𝑠𝑃 → ((2nd ‘(1st𝑠)) ⊆ (mEx‘𝑇) ∧ (2nd ‘(1st𝑠)) ∈ Fin))
3321simp3d 1142 . . . . 5 (𝑠𝑃 → (2nd𝑠) ∈ (mEx‘𝑇))
3418, 19, 5elmpst 35136 . . . . 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 1341 . . . 4 (𝑠𝑃 → ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
3616, 35eqeltrd 2828 . . 3 (𝑠𝑃 → (𝑅𝑠) ∈ 𝑃)
3736rgen 3058 . 2 𝑠𝑃 (𝑅𝑠) ∈ 𝑃
38 ffnfv 7123 . 2 (𝑅:𝑃𝑃 ↔ (𝑅 Fn 𝑃 ∧ ∀𝑠𝑃 (𝑅𝑠) ∈ 𝑃))
398, 37, 38mpbir2an 710 1 𝑅:𝑃𝑃
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1085   = wceq 1534  wcel 2099  wral 3056  csb 3889  cun 3942  cin 3943  wss 3944  {csn 4624  cotp 4632   cuni 4903   × cxp 5670  ccnv 5671  cima 5675   Fn wfn 6537  wf 6538  cfv 6542  1st c1st 7985  2nd c2nd 7986  Fincfn 8957  mExcmex 35067  mDVcmdv 35068  mVarscmvrs 35069  mPreStcmpst 35073  mStRedcmsr 35074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-ot 4633  df-uni 4904  df-iun 4993  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-1st 7987  df-2nd 7988  df-mpst 35093  df-msr 35094
This theorem is referenced by:  msrrcl  35143  msrid  35145  msrfo  35146  mstapst  35147  elmsta  35148  elmthm  35176  mthmsta  35178  mthmblem  35180
  Copyright terms: Public domain W3C validator