![]() |
Mathbox for Mario Carneiro |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > mvhf1 | Structured version Visualization version GIF version |
Description: The function mapping variables to variable expressions is one-to-one. (Contributed by Mario Carneiro, 18-Jul-2016.) |
Ref | Expression |
---|---|
mvhf.v | ⊢ 𝑉 = (mVR‘𝑇) |
mvhf.e | ⊢ 𝐸 = (mEx‘𝑇) |
mvhf.h | ⊢ 𝐻 = (mVH‘𝑇) |
Ref | Expression |
---|---|
mvhf1 | ⊢ (𝑇 ∈ mFS → 𝐻:𝑉–1-1→𝐸) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mvhf.v | . . 3 ⊢ 𝑉 = (mVR‘𝑇) | |
2 | mvhf.e | . . 3 ⊢ 𝐸 = (mEx‘𝑇) | |
3 | mvhf.h | . . 3 ⊢ 𝐻 = (mVH‘𝑇) | |
4 | 1, 2, 3 | mvhf 32918 | . 2 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸) |
5 | eqid 2798 | . . . . . . 7 ⊢ (mType‘𝑇) = (mType‘𝑇) | |
6 | 1, 5, 3 | mvhval 32894 | . . . . . 6 ⊢ (𝑣 ∈ 𝑉 → (𝐻‘𝑣) = 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉) |
7 | 1, 5, 3 | mvhval 32894 | . . . . . 6 ⊢ (𝑤 ∈ 𝑉 → (𝐻‘𝑤) = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉) |
8 | 6, 7 | eqeqan12d 2815 | . . . . 5 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉) → ((𝐻‘𝑣) = (𝐻‘𝑤) ↔ 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉)) |
9 | 8 | adantl 485 | . . . 4 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → ((𝐻‘𝑣) = (𝐻‘𝑤) ↔ 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉)) |
10 | fvex 6658 | . . . . . . 7 ⊢ ((mType‘𝑇)‘𝑣) ∈ V | |
11 | s1cli 13950 | . . . . . . . 8 ⊢ 〈“𝑣”〉 ∈ Word V | |
12 | 11 | elexi 3460 | . . . . . . 7 ⊢ 〈“𝑣”〉 ∈ V |
13 | 10, 12 | opth 5333 | . . . . . 6 ⊢ (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 ↔ (((mType‘𝑇)‘𝑣) = ((mType‘𝑇)‘𝑤) ∧ 〈“𝑣”〉 = 〈“𝑤”〉)) |
14 | 13 | simprbi 500 | . . . . 5 ⊢ (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 → 〈“𝑣”〉 = 〈“𝑤”〉) |
15 | s111 13960 | . . . . . 6 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉) → (〈“𝑣”〉 = 〈“𝑤”〉 ↔ 𝑣 = 𝑤)) | |
16 | 15 | adantl 485 | . . . . 5 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → (〈“𝑣”〉 = 〈“𝑤”〉 ↔ 𝑣 = 𝑤)) |
17 | 14, 16 | syl5ib 247 | . . . 4 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 → 𝑣 = 𝑤)) |
18 | 9, 17 | sylbid 243 | . . 3 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤)) |
19 | 18 | ralrimivva 3156 | . 2 ⊢ (𝑇 ∈ mFS → ∀𝑣 ∈ 𝑉 ∀𝑤 ∈ 𝑉 ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤)) |
20 | dff13 6991 | . 2 ⊢ (𝐻:𝑉–1-1→𝐸 ↔ (𝐻:𝑉⟶𝐸 ∧ ∀𝑣 ∈ 𝑉 ∀𝑤 ∈ 𝑉 ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤))) | |
21 | 4, 19, 20 | sylanbrc 586 | 1 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉–1-1→𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∀wral 3106 Vcvv 3441 〈cop 4531 ⟶wf 6320 –1-1→wf1 6321 ‘cfv 6324 Word cword 13857 〈“cs1 13940 mVRcmvar 32821 mTypecmty 32822 mExcmex 32827 mVHcmvh 32832 mFScmfs 32836 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-s1 13941 df-mrex 32846 df-mex 32847 df-mvh 32852 df-mfs 32856 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |