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 32702 | . 2 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸) |
5 | eqid 2818 | . . . . . . 7 ⊢ (mType‘𝑇) = (mType‘𝑇) | |
6 | 1, 5, 3 | mvhval 32678 | . . . . . 6 ⊢ (𝑣 ∈ 𝑉 → (𝐻‘𝑣) = 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉) |
7 | 1, 5, 3 | mvhval 32678 | . . . . . 6 ⊢ (𝑤 ∈ 𝑉 → (𝐻‘𝑤) = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉) |
8 | 6, 7 | eqeqan12d 2835 | . . . . 5 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉) → ((𝐻‘𝑣) = (𝐻‘𝑤) ↔ 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉)) |
9 | 8 | adantl 482 | . . . 4 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → ((𝐻‘𝑣) = (𝐻‘𝑤) ↔ 〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉)) |
10 | fvex 6676 | . . . . . . 7 ⊢ ((mType‘𝑇)‘𝑣) ∈ V | |
11 | s1cli 13947 | . . . . . . . 8 ⊢ 〈“𝑣”〉 ∈ Word V | |
12 | 11 | elexi 3511 | . . . . . . 7 ⊢ 〈“𝑣”〉 ∈ V |
13 | 10, 12 | opth 5359 | . . . . . 6 ⊢ (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 ↔ (((mType‘𝑇)‘𝑣) = ((mType‘𝑇)‘𝑤) ∧ 〈“𝑣”〉 = 〈“𝑤”〉)) |
14 | 13 | simprbi 497 | . . . . 5 ⊢ (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 → 〈“𝑣”〉 = 〈“𝑤”〉) |
15 | s111 13957 | . . . . . 6 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉) → (〈“𝑣”〉 = 〈“𝑤”〉 ↔ 𝑣 = 𝑤)) | |
16 | 15 | adantl 482 | . . . . 5 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → (〈“𝑣”〉 = 〈“𝑤”〉 ↔ 𝑣 = 𝑤)) |
17 | 14, 16 | syl5ib 245 | . . . 4 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → (〈((mType‘𝑇)‘𝑣), 〈“𝑣”〉〉 = 〈((mType‘𝑇)‘𝑤), 〈“𝑤”〉〉 → 𝑣 = 𝑤)) |
18 | 9, 17 | sylbid 241 | . . 3 ⊢ ((𝑇 ∈ mFS ∧ (𝑣 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉)) → ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤)) |
19 | 18 | ralrimivva 3188 | . 2 ⊢ (𝑇 ∈ mFS → ∀𝑣 ∈ 𝑉 ∀𝑤 ∈ 𝑉 ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤)) |
20 | dff13 7004 | . 2 ⊢ (𝐻:𝑉–1-1→𝐸 ↔ (𝐻:𝑉⟶𝐸 ∧ ∀𝑣 ∈ 𝑉 ∀𝑤 ∈ 𝑉 ((𝐻‘𝑣) = (𝐻‘𝑤) → 𝑣 = 𝑤))) | |
21 | 4, 19, 20 | sylanbrc 583 | 1 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉–1-1→𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ∀wral 3135 Vcvv 3492 〈cop 4563 ⟶wf 6344 –1-1→wf1 6345 ‘cfv 6348 Word cword 13849 〈“cs1 13937 mVRcmvar 32605 mTypecmty 32606 mExcmex 32611 mVHcmvh 32616 mFScmfs 32620 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 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-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-hash 13679 df-word 13850 df-s1 13938 df-mrex 32630 df-mex 32631 df-mvh 32636 df-mfs 32640 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |