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 32795
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 2819 . . . . 5 (mCN‘𝑇) = (mCN‘𝑇)
2 eqid 2819 . . . . 5 (mVR‘𝑇) = (mVR‘𝑇)
3 mvtinf.y . . . . 5 𝑌 = (mType‘𝑇)
4 mvtinf.f . . . . 5 𝐹 = (mVT‘𝑇)
5 eqid 2819 . . . . 5 (mTC‘𝑇) = (mTC‘𝑇)
6 eqid 2819 . . . . 5 (mAx‘𝑇) = (mAx‘𝑇)
7 eqid 2819 . . . . 5 (mStat‘𝑇) = (mStat‘𝑇)
81, 2, 3, 4, 5, 6, 7ismfs 32789 . . . 4 (𝑇 ∈ mFS → (𝑇 ∈ mFS ↔ ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ 𝑌:(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ ((mAx‘𝑇) ⊆ (mStat‘𝑇) ∧ ∀𝑣𝐹 ¬ (𝑌 “ {𝑣}) ∈ Fin))))
98ibi 269 . . 3 (𝑇 ∈ mFS → ((((mCN‘𝑇) ∩ (mVR‘𝑇)) = ∅ ∧ 𝑌:(mVR‘𝑇)⟶(mTC‘𝑇)) ∧ ((mAx‘𝑇) ⊆ (mStat‘𝑇) ∧ ∀𝑣𝐹 ¬ (𝑌 “ {𝑣}) ∈ Fin)))
109simprrd 772 . 2 (𝑇 ∈ mFS → ∀𝑣𝐹 ¬ (𝑌 “ {𝑣}) ∈ Fin)
11 sneq 4569 . . . . . 6 (𝑣 = 𝑋 → {𝑣} = {𝑋})
1211imaeq2d 5922 . . . . 5 (𝑣 = 𝑋 → (𝑌 “ {𝑣}) = (𝑌 “ {𝑋}))
1312eleq1d 2895 . . . 4 (𝑣 = 𝑋 → ((𝑌 “ {𝑣}) ∈ Fin ↔ (𝑌 “ {𝑋}) ∈ Fin))
1413notbid 320 . . 3 (𝑣 = 𝑋 → (¬ (𝑌 “ {𝑣}) ∈ Fin ↔ ¬ (𝑌 “ {𝑋}) ∈ Fin))
1514rspccva 3620 . 2 ((∀𝑣𝐹 ¬ (𝑌 “ {𝑣}) ∈ Fin ∧ 𝑋𝐹) → ¬ (𝑌 “ {𝑋}) ∈ Fin)
1610, 15sylan 582 1 ((𝑇 ∈ mFS ∧ 𝑋𝐹) → ¬ (𝑌 “ {𝑋}) ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1531  wcel 2108  wral 3136  cin 3933  wss 3934  c0 4289  {csn 4559  ccnv 5547  cima 5551  wf 6344  cfv 6348  Fincfn 8501  mCNcmcn 32700  mVRcmvar 32701  mTypecmty 32702  mVTcmvt 32703  mTCcmtc 32704  mAxcmax 32705  mStatcmsta 32715  mFScmfs 32716
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 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-mfs 32736
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator