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

Theorem mvtinf 36521
Description: Each variable typecode has infinitely many variables. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mvtinf.f 𝐹 = (mVT‘𝑇)
mvtinf.y 𝑌 = (mType‘𝑇)
Assertion
Ref Expression
mvtinf ((𝑇 ∈ mFS ∧ 𝑋 ∈ 𝐹) → ¬ (◡𝑌 “ {𝑋}) ∈ Fin)

Proof of Theorem mvtinf
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . . 5 (mCN‘𝑇) = (mCN‘𝑇)
2 eqid 2763 . . . . 5 (mVR‘𝑇) = (mVR‘𝑇)
3 mvtinf.y . . . . 5 𝑌 = (mType‘𝑇)
4 mvtinf.f . . . . 5 𝐹 = (mVT‘𝑇)
5 eqid 2763 . . . . 5 (mTC‘𝑇) = (mTC‘𝑇)
6 eqid 2763 . . . . 5 (mAx‘𝑇) = (mAx‘𝑇)
7 eqid 2763 . . . . 5 (mStat‘𝑇) = (mStat‘𝑇)
81, 2, 3, 4, 5, 6, 7ismfs 36515 . . . 4 (𝑇 ∈ mFS → (𝑇 ∈ mFS ↔ ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ 𝑌:(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ ((mAx‘𝑇) ⊆ (mStat‘𝑇) ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin))))
98ibi 270 . . 3 (𝑇 ∈ mFS → ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ 𝑌:(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ ((mAx‘𝑇) ⊆ (mStat‘𝑇) ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin)))
109simprrd 786 . 2 (𝑇 ∈ mFS → ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin)
11 sneq 4594 . . . . . 6 (𝑣 = 𝑋 → {𝑣} = {𝑋})
1211imaeq2d 6068 . . . . 5 (𝑣 = 𝑋 → (◡𝑌 “ {𝑣}) = (◡𝑌 “ {𝑋}))
1312eleq1d 2849 . . . 4 (𝑣 = 𝑋 → ((◡𝑌 “ {𝑣}) ∈ Fin ↔ (◡𝑌 “ {𝑋}) ∈ Fin))
1413notbid 321 . . 3 (𝑣 = 𝑋 → (¬ (◡𝑌 “ {𝑣}) ∈ Fin ↔ ¬ (◡𝑌 “ {𝑋}) ∈ Fin))
1514rspccva 3579 . 2 ((∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin ∧ 𝑋 ∈ 𝐹) → ¬ (◡𝑌 “ {𝑋}) ∈ Fin)
1610, 15sylan 592 1 ((𝑇 ∈ mFS ∧ 𝑋 ∈ 𝐹) → ¬ (◡𝑌 “ {𝑋}) ∈ Fin)
Colors of variables:    wff setvar class
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 5655   “ cima 5659  ⟶wf 6560  ‘cfv 6564  Fincfn 9009  mCNcmcn 36426  mVRcmvar 36427  mTypecmty 36428  mVTcmvt 36429  mTCcmtc 36430  mAxcmax 36431  mStatcmsta 36441  mFScmfs 36442
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 5172  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-fv 6572  df-mfs 36462
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator