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

Theorem elmsta 33954
Description: Property of being a statement. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mstapst.p 𝑃 = (mPreSt‘𝑇)
mstapst.s 𝑆 = (mStat‘𝑇)
elmsta.v 𝑉 = (mVars‘𝑇)
elmsta.z 𝑍 = (𝑉 “ (𝐻 ∪ {𝐴}))
Assertion
Ref Expression
elmsta (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 ↔ (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)))

Proof of Theorem elmsta
StepHypRef Expression
1 mstapst.p . . . . 5 𝑃 = (mPreSt‘𝑇)
2 mstapst.s . . . . 5 𝑆 = (mStat‘𝑇)
31, 2mstapst 33953 . . . 4 𝑆𝑃
43sseli 3938 . . 3 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → ⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃)
5 elmsta.v . . . . . . . . . 10 𝑉 = (mVars‘𝑇)
6 eqid 2737 . . . . . . . . . 10 (mStRed‘𝑇) = (mStRed‘𝑇)
7 elmsta.z . . . . . . . . . 10 𝑍 = (𝑉 “ (𝐻 ∪ {𝐴}))
85, 1, 6, 7msrval 33944 . . . . . . . . 9 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃 → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) = ⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)
94, 8syl 17 . . . . . . . 8 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) = ⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)
106, 2msrid 33951 . . . . . . . 8 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) = ⟨𝐷, 𝐻, 𝐴⟩)
119, 10eqtr3d 2779 . . . . . . 7 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → ⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩ = ⟨𝐷, 𝐻, 𝐴⟩)
1211fveq2d 6843 . . . . . 6 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (1st ‘⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩) = (1st ‘⟨𝐷, 𝐻, 𝐴⟩))
1312fveq2d 6843 . . . . 5 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (1st ‘(1st ‘⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)) = (1st ‘(1st ‘⟨𝐷, 𝐻, 𝐴⟩)))
14 inss1 4186 . . . . . . 7 (𝐷 ∩ (𝑍 × 𝑍)) ⊆ 𝐷
151mpstrcl 33947 . . . . . . . . 9 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃 → (𝐷 ∈ V ∧ 𝐻 ∈ V ∧ 𝐴 ∈ V))
164, 15syl 17 . . . . . . . 8 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (𝐷 ∈ V ∧ 𝐻 ∈ V ∧ 𝐴 ∈ V))
1716simp1d 1142 . . . . . . 7 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆𝐷 ∈ V)
18 ssexg 5278 . . . . . . 7 (((𝐷 ∩ (𝑍 × 𝑍)) ⊆ 𝐷𝐷 ∈ V) → (𝐷 ∩ (𝑍 × 𝑍)) ∈ V)
1914, 17, 18sylancr 587 . . . . . 6 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (𝐷 ∩ (𝑍 × 𝑍)) ∈ V)
2016simp2d 1143 . . . . . 6 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆𝐻 ∈ V)
2116simp3d 1144 . . . . . 6 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆𝐴 ∈ V)
22 ot1stg 7927 . . . . . 6 (((𝐷 ∩ (𝑍 × 𝑍)) ∈ V ∧ 𝐻 ∈ V ∧ 𝐴 ∈ V) → (1st ‘(1st ‘⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)) = (𝐷 ∩ (𝑍 × 𝑍)))
2319, 20, 21, 22syl3anc 1371 . . . . 5 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (1st ‘(1st ‘⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)) = (𝐷 ∩ (𝑍 × 𝑍)))
24 ot1stg 7927 . . . . . 6 ((𝐷 ∈ V ∧ 𝐻 ∈ V ∧ 𝐴 ∈ V) → (1st ‘(1st ‘⟨𝐷, 𝐻, 𝐴⟩)) = 𝐷)
2516, 24syl 17 . . . . 5 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (1st ‘(1st ‘⟨𝐷, 𝐻, 𝐴⟩)) = 𝐷)
2613, 23, 253eqtr3d 2785 . . . 4 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (𝐷 ∩ (𝑍 × 𝑍)) = 𝐷)
27 inss2 4187 . . . 4 (𝐷 ∩ (𝑍 × 𝑍)) ⊆ (𝑍 × 𝑍)
2826, 27eqsstrrdi 3997 . . 3 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆𝐷 ⊆ (𝑍 × 𝑍))
294, 28jca 512 . 2 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 → (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)))
308adantr 481 . . . . 5 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) = ⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩)
31 simpr 485 . . . . . . 7 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → 𝐷 ⊆ (𝑍 × 𝑍))
32 df-ss 3925 . . . . . . 7 (𝐷 ⊆ (𝑍 × 𝑍) ↔ (𝐷 ∩ (𝑍 × 𝑍)) = 𝐷)
3331, 32sylib 217 . . . . . 6 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → (𝐷 ∩ (𝑍 × 𝑍)) = 𝐷)
3433oteq1d 4840 . . . . 5 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ⟨(𝐷 ∩ (𝑍 × 𝑍)), 𝐻, 𝐴⟩ = ⟨𝐷, 𝐻, 𝐴⟩)
3530, 34eqtrd 2777 . . . 4 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) = ⟨𝐷, 𝐻, 𝐴⟩)
361, 6msrf 33948 . . . . . 6 (mStRed‘𝑇):𝑃𝑃
37 ffn 6665 . . . . . 6 ((mStRed‘𝑇):𝑃𝑃 → (mStRed‘𝑇) Fn 𝑃)
3836, 37ax-mp 5 . . . . 5 (mStRed‘𝑇) Fn 𝑃
39 simpl 483 . . . . 5 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃)
40 fnfvelrn 7028 . . . . 5 (((mStRed‘𝑇) Fn 𝑃 ∧ ⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃) → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) ∈ ran (mStRed‘𝑇))
4138, 39, 40sylancr 587 . . . 4 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ((mStRed‘𝑇)‘⟨𝐷, 𝐻, 𝐴⟩) ∈ ran (mStRed‘𝑇))
4235, 41eqeltrrd 2839 . . 3 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ⟨𝐷, 𝐻, 𝐴⟩ ∈ ran (mStRed‘𝑇))
436, 2mstaval 33950 . . 3 𝑆 = ran (mStRed‘𝑇)
4442, 43eleqtrrdi 2849 . 2 ((⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)) → ⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆)
4529, 44impbii 208 1 (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑆 ↔ (⟨𝐷, 𝐻, 𝐴⟩ ∈ 𝑃𝐷 ⊆ (𝑍 × 𝑍)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  Vcvv 3443  cun 3906  cin 3907  wss 3908  {csn 4584  cotp 4592   cuni 4863   × cxp 5629  ran crn 5632  cima 5634   Fn wfn 6488  wf 6489  cfv 6493  1st c1st 7911  mVarscmvrs 33875  mPreStcmpst 33879  mStRedcmsr 33880  mStatcmsta 33881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-rep 5240  ax-sep 5254  ax-nul 5261  ax-pow 5318  ax-pr 5382  ax-un 7664
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-ot 4593  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-id 5529  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-1st 7913  df-2nd 7914  df-mpst 33899  df-msr 33900  df-msta 33901
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator