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 35586
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 5403 . . . . 5 ⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
21csbex 5247 . . . 4 (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
32csbex 5247 . . 3 (2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩ ∈ V
4 eqid 2731 . . . 4 (mVars‘𝑇) = (mVars‘𝑇)
5 mpstssv.p . . . 4 𝑃 = (mPreSt‘𝑇)
6 msrf.r . . . 4 𝑅 = (mStRed‘𝑇)
74, 5, 6msrfval 35581 . . 3 𝑅 = (𝑠𝑃(2nd ‘(1st𝑠)) / (2nd𝑠) / 𝑎⟨((1st ‘(1st𝑠)) ∩ ((mVars‘𝑇) “ ( ∪ {𝑎})) / 𝑧(𝑧 × 𝑧)), , 𝑎⟩)
83, 7fnmpti 6624 . 2 𝑅 Fn 𝑃
95mpst123 35584 . . . . . 6 (𝑠𝑃𝑠 = ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
109fveq2d 6826 . . . . 5 (𝑠𝑃 → (𝑅𝑠) = (𝑅‘⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩))
11 id 22 . . . . . . 7 (𝑠𝑃𝑠𝑃)
129, 11eqeltrrd 2832 . . . . . 6 (𝑠𝑃 → ⟨(1st ‘(1st𝑠)), (2nd ‘(1st𝑠)), (2nd𝑠)⟩ ∈ 𝑃)
13 eqid 2731 . . . . . . 7 ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) = ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)}))
144, 5, 6, 13msrval 35582 . . . . . 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 2766 . . . 4 (𝑠𝑃 → (𝑅𝑠) = ⟨((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))), (2nd ‘(1st𝑠)), (2nd𝑠)⟩)
17 inss1 4184 . . . . . . 7 ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (1st ‘(1st𝑠))
18 eqid 2731 . . . . . . . . . . 11 (mDV‘𝑇) = (mDV‘𝑇)
19 eqid 2731 . . . . . . . . . . 11 (mEx‘𝑇) = (mEx‘𝑇)
2018, 19, 5elmpst 35580 . . . . . . . . . 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 3941 . . . . . 6 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) ⊆ (mDV‘𝑇))
25 cnvin 6091 . . . . . . 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 6104 . . . . . . . . 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 4168 . . . . . . 7 (𝑠𝑃 → ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))) = ((1st ‘(1st𝑠)) ∩ ( ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})) × ((mVars‘𝑇) “ ((2nd ‘(1st𝑠)) ∪ {(2nd𝑠)})))))
3025, 29eqtrid 2778 . . . . . 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 35580 . . . . 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 2831 . . 3 (𝑠𝑃 → (𝑅𝑠) ∈ 𝑃)
3736rgen 3049 . 2 𝑠𝑃 (𝑅𝑠) ∈ 𝑃
38 ffnfv 7052 . 2 (𝑅:𝑃𝑃 ↔ (𝑅 Fn 𝑃 ∧ ∀𝑠𝑃 (𝑅𝑠) ∈ 𝑃))
398, 37, 38mpbir2an 711 1 𝑅:𝑃𝑃
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1086   = wceq 1541  wcel 2111  wral 3047  csb 3845  cun 3895  cin 3896  wss 3897  {csn 4573  cotp 4581   cuni 4856   × cxp 5612  ccnv 5613  cima 5617   Fn wfn 6476  wf 6477  cfv 6481  1st c1st 7919  2nd c2nd 7920  Fincfn 8869  mExcmex 35511  mDVcmdv 35512  mVarscmvrs 35513  mPreStcmpst 35517  mStRedcmsr 35518
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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
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 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-ot 4582  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-1st 7921  df-2nd 7922  df-mpst 35537  df-msr 35538
This theorem is referenced by:  msrrcl  35587  msrid  35589  msrfo  35590  mstapst  35591  elmsta  35592  elmthm  35620  mthmsta  35622  mthmblem  35624
  Copyright terms: Public domain W3C validator