Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mvtss | Structured version Visualization version GIF version |
Description: The set of variable typecodes is a subset of all typecodes. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mvtss.f | ⊢ 𝐹 = (mVT‘𝑇) |
mvtss.k | ⊢ 𝐾 = (mTC‘𝑇) |
Ref | Expression |
---|---|
mvtss | ⊢ (𝑇 ∈ mFS → 𝐹 ⊆ 𝐾) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mvtss.f | . . 3 ⊢ 𝐹 = (mVT‘𝑇) | |
2 | eqid 2823 | . . 3 ⊢ (mType‘𝑇) = (mType‘𝑇) | |
3 | 1, 2 | mvtval 32749 | . 2 ⊢ 𝐹 = ran (mType‘𝑇) |
4 | eqid 2823 | . . . 4 ⊢ (mVR‘𝑇) = (mVR‘𝑇) | |
5 | mvtss.k | . . . 4 ⊢ 𝐾 = (mTC‘𝑇) | |
6 | 4, 5, 2 | mtyf2 32800 | . . 3 ⊢ (𝑇 ∈ mFS → (mType‘𝑇):(mVR‘𝑇)⟶𝐾) |
7 | 6 | frnd 6523 | . 2 ⊢ (𝑇 ∈ mFS → ran (mType‘𝑇) ⊆ 𝐾) |
8 | 3, 7 | eqsstrid 4017 | 1 ⊢ (𝑇 ∈ mFS → 𝐹 ⊆ 𝐾) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ⊆ wss 3938 ran crn 5558 ‘cfv 6357 mVRcmvar 32710 mTypecmty 32711 mVTcmvt 32712 mTCcmtc 32713 mFScmfs 32725 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-fv 6365 df-mvt 32734 df-mfs 32745 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |