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 36299
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 2761 . . . . 5 (mCN‘𝑇) = (mCN‘𝑇)
2 eqid 2761 . . . . 5 (mVR‘𝑇) = (mVR‘𝑇)
3 mvtinf.y . . . . 5 𝑌 = (mType‘𝑇)
4 mvtinf.f . . . . 5 𝐹 = (mVT‘𝑇)
5 eqid 2761 . . . . 5 (mTC‘𝑇) = (mTC‘𝑇)
6 eqid 2761 . . . . 5 (mAx‘𝑇) = (mAx‘𝑇)
7 eqid 2761 . . . . 5 (mStat‘𝑇) = (mStat‘𝑇)
81, 2, 3, 4, 5, 6, 7ismfs 36293 . . . 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 6052 . . . . 5 (𝑣 = 𝑋 → (◡𝑌 “ {𝑣}) = (◡𝑌 “ {𝑋}))
1312eleq1d 2846 . . . 4 (𝑣 = 𝑋 → ((◡𝑌 “ {𝑣}) ∈ Fin ↔ (◡𝑌 “ {𝑋}) ∈ Fin))
1413notbid 321 . . 3 (𝑣 = 𝑋 → (¬ (◡𝑌 “ {𝑣}) ∈ Fin ↔ ¬ (◡𝑌 “ {𝑋}) ∈ Fin))
1514rspccva 3576 . 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 2145  ∀wral 3077   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584  ◡ccnv 5650   “ cima 5654  ⟶wf 6533  ‘cfv 6537  Fincfn 8966  mCNcmcn 36204  mVRcmvar 36205  mTypecmty 36206  mVTcmvt 36207  mTCcmtc 36208  mAxcmax 36209  mStatcmsta 36219  mFScmfs 36220
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-mfs 36240
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator