| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ttgitvval | Structured version Visualization version GIF version | ||
| Description: Betweenness for a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.) |
| Ref | Expression |
|---|---|
| ttgval.n | ⊢ 𝐺 = (toTG‘𝐻) |
| ttgitvval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| ttgitvval.b | ⊢ 𝑃 = (Base‘𝐻) |
| ttgitvval.m | ⊢ − = (-g‘𝐻) |
| ttgitvval.s | ⊢ · = ( ·𝑠 ‘𝐻) |
| Ref | Expression |
|---|---|
| ttgitvval | ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ttgval.n | . . . . 5 ⊢ 𝐺 = (toTG‘𝐻) | |
| 2 | ttgitvval.b | . . . . 5 ⊢ 𝑃 = (Base‘𝐻) | |
| 3 | ttgitvval.m | . . . . 5 ⊢ − = (-g‘𝐻) | |
| 4 | ttgitvval.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝐻) | |
| 5 | ttgitvval.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
| 6 | 1, 2, 3, 4, 5 | ttgval 28968 | . . . 4 ⊢ (𝐻 ∈ 𝑉 → (𝐺 = ((𝐻 sSet 〈(Itv‘ndx), (𝑥 ∈ 𝑃, 𝑦 ∈ 𝑃 ↦ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥))})〉) sSet 〈(LineG‘ndx), (𝑥 ∈ 𝑃, 𝑦 ∈ 𝑃 ↦ {𝑧 ∈ 𝑃 ∣ (𝑧 ∈ (𝑥𝐼𝑦) ∨ 𝑥 ∈ (𝑧𝐼𝑦) ∨ 𝑦 ∈ (𝑥𝐼𝑧))})〉) ∧ 𝐼 = (𝑥 ∈ 𝑃, 𝑦 ∈ 𝑃 ↦ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥))}))) |
| 7 | 6 | simprd 496 | . . 3 ⊢ (𝐻 ∈ 𝑉 → 𝐼 = (𝑥 ∈ 𝑃, 𝑦 ∈ 𝑃 ↦ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥))})) |
| 8 | 7 | 3ad2ant1 1139 | . 2 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → 𝐼 = (𝑥 ∈ 𝑃, 𝑦 ∈ 𝑃 ↦ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥))})) |
| 9 | simprl 776 | . . . . . 6 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑥 = 𝑋) | |
| 10 | 9 | oveq2d 7379 | . . . . 5 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑧 − 𝑥) = (𝑧 − 𝑋)) |
| 11 | simprr 778 | . . . . . . 7 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → 𝑦 = 𝑌) | |
| 12 | 11, 9 | oveq12d 7381 | . . . . . 6 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑦 − 𝑥) = (𝑌 − 𝑋)) |
| 13 | 12 | oveq2d 7379 | . . . . 5 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑘 · (𝑦 − 𝑥)) = (𝑘 · (𝑌 − 𝑋))) |
| 14 | 10, 13 | eqeq12d 2756 | . . . 4 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ((𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥)) ↔ (𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| 15 | 14 | rexbidv 3164 | . . 3 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥)) ↔ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| 16 | 15 | rabbidv 3399 | . 2 ⊢ (((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑥) = (𝑘 · (𝑦 − 𝑥))} = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}) |
| 17 | simp2 1143 | . 2 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → 𝑋 ∈ 𝑃) | |
| 18 | simp3 1144 | . 2 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → 𝑌 ∈ 𝑃) | |
| 19 | 2 | fvexi 6848 | . . . 4 ⊢ 𝑃 ∈ V |
| 20 | 19 | rabex 5274 | . . 3 ⊢ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))} ∈ V |
| 21 | 20 | a1i 11 | . 2 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))} ∈ V) |
| 22 | 8, 16, 17, 18, 21 | ovmpod 7515 | 1 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∨ w3o 1091 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 {crab 3392 Vcvv 3432 〈cop 4568 ‘cfv 6492 (class class class)co 7363 ∈ cmpo 7365 0cc0 11036 1c1 11037 [,]cicc 13299 sSet csts 17131 ndxcnx 17161 Basecbs 17177 ·𝑠 cvsca 17222 -gcsg 18909 Itvcitv 28526 LineGclng 28527 toTGcttg 28966 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-8 12248 df-9 12249 df-n0 12436 df-dec 12643 df-sets 17132 df-slot 17150 df-ndx 17162 df-itv 28528 df-lng 28529 df-ttg 28967 |
| This theorem is referenced by: ttgelitv 28976 |
| Copyright terms: Public domain | W3C validator |