| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ttgelitv | 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 | ⊢ · = ( ·𝑠 ‘𝐻) |
| ttgelitv.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| ttgelitv.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| ttgelitv.h | ⊢ (𝜑 → 𝐻 ∈ 𝑉) |
| ttgelitv.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| ttgelitv | ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ttgelitv.z | . 2 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
| 2 | ttgelitv.h | . . . . 5 ⊢ (𝜑 → 𝐻 ∈ 𝑉) | |
| 3 | ttgelitv.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 4 | ttgelitv.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 5 | ttgval.n | . . . . . 6 ⊢ 𝐺 = (toTG‘𝐻) | |
| 6 | ttgitvval.i | . . . . . 6 ⊢ 𝐼 = (Itv‘𝐺) | |
| 7 | ttgitvval.b | . . . . . 6 ⊢ 𝑃 = (Base‘𝐻) | |
| 8 | ttgitvval.m | . . . . . 6 ⊢ − = (-g‘𝐻) | |
| 9 | ttgitvval.s | . . . . . 6 ⊢ · = ( ·𝑠 ‘𝐻) | |
| 10 | 5, 6, 7, 8, 9 | ttgitvval 29172 | . . . . 5 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}) |
| 11 | 2, 3, 4, 10 | syl3anc 1396 | . . . 4 ⊢ (𝜑 → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}) |
| 12 | 11 | eleq2d 2855 | . . 3 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))})) |
| 13 | oveq1 7418 | . . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑧 − 𝑋) = (𝑍 − 𝑋)) | |
| 14 | 13 | eqeq1d 2771 | . . . . 5 ⊢ (𝑧 = 𝑍 → ((𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)) ↔ (𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| 15 | 14 | rexbidv 3195 | . . . 4 ⊢ (𝑧 = 𝑍 → (∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| 16 | 15 | elrab 3657 | . . 3 ⊢ (𝑍 ∈ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))} ↔ (𝑍 ∈ 𝑃 ∧ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| 17 | 12, 16 | bitrdi 290 | . 2 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ (𝑍 ∈ 𝑃 ∧ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))) |
| 18 | 1, 17 | mpbirand 719 | 1 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 {crab 3422 ‘cfv 6537 (class class class)co 7411 0cc0 11100 1c1 11101 [,]cicc 13375 Basecbs 17269 ·𝑠 cvsca 17314 -gcsg 19002 Itvcitv 28668 toTGcttg 29163 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-dec 12712 df-sets 17224 df-slot 17242 df-ndx 17254 df-itv 28670 df-lng 28671 df-ttg 29164 |
| This theorem is referenced by: ttgbtwnid 29174 ttgcontlem1 29175 |
| Copyright terms: Public domain | W3C validator |