Theorem maxsta 36486

Description: An axiom is a statement. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
maxsta.a	⊢ 𝐴 = (mAx‘𝑇)
maxsta.s	⊢ 𝑆 = (mStat‘𝑇)

Assertion

Ref	Expression
maxsta	⊢ (𝑇 ∈ mFS → 𝐴 ⊆ 𝑆)

Proof of Theorem maxsta

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2763	. . . 4 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
2		eqid 2763	. . . 4 ⊢ (mVR‘𝑇) = (mVR‘𝑇)
3		eqid 2763	. . . 4 ⊢ (mType‘𝑇) = (mType‘𝑇)
4		eqid 2763	. . . 4 ⊢ (mVT‘𝑇) = (mVT‘𝑇)
5		eqid 2763	. . . 4 ⊢ (mTC‘𝑇) = (mTC‘𝑇)
6		maxsta.a	. . . 4 ⊢ 𝐴 = (mAx‘𝑇)
7		maxsta.s	. . . 4 ⊢ 𝑆 = (mStat‘𝑇)
8	1, 2, 3, 4, 5, 6, 7	ismfs 36481	. . 3 ⊢ (𝑇 ∈ mFS → (𝑇 ∈ mFS ↔ ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ (mType‘𝑇):(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ (mVT‘𝑇) ¬ (◡(mType‘𝑇) “ {𝑣}) ∈ Fin))))
9	8	ibi 270	. 2 ⊢ (𝑇 ∈ mFS → ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ (mType‘𝑇):(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ (mVT‘𝑇) ¬ (◡(mType‘𝑇) “ {𝑣}) ∈ Fin)))
10	9	simprld 784	1 ⊢ (𝑇 ∈ mFS → 𝐴 ⊆ 𝑆)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  {csn 4588  ^◡ccnv 5654   “ cima 5658  ⟶wf 6554  ‘cfv 6558  Fincfn 9001  mCNcmcn 36392  mVRcmvar 36393  mTypecmty 36394  mVTcmvt 36395  mTCcmtc 36396  mAxcmax 36397  mStatcmsta 36407  mFScmfs 36408

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-mfs 36428

This theorem is used by:  mclsssvlem  36494  mclsax  36501  mclsind  36502  mclsppslem  36515