ttgelitv - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ttgelitv		Structured version Visualization version GIF version

Theorem ttgelitv 28912

Description: Betweenness for a subcomplex Hilbert space augmented with betweenness. (Contributed by Thierry Arnoux, 25-Mar-2019.)

**Hypotheses**
Ref	Expression
ttgval.n	⊢ 𝐺 = (toTG‘𝐻)
ttgitvval.i	⊢ 𝐼 = (Itv‘𝐺)
ttgitvval.b	⊢ 𝑃 = (Base‘𝐻)
ttgitvval.m	⊢ − = (-_g‘𝐻)
ttgitvval.s	⊢ · = ( ·_𝑠 ‘𝐻)
ttgelitv.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
ttgelitv.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
ttgelitv.h	⊢ (𝜑 → 𝐻 ∈ 𝑉)
ttgelitv.z	⊢ (𝜑 → 𝑍 ∈ 𝑃)

**Assertion**
Ref	Expression
ttgelitv	⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))

Distinct variable groups: − ,𝑘 𝑘,𝐻 𝑃,𝑘 𝑘,𝑉 𝑘,𝑋 𝑘,𝑌 𝑘,𝑍 Allowed substitution hints: 𝜑(𝑘) · (𝑘) 𝐺(𝑘) 𝐼(𝑘)

Proof of Theorem ttgelitv Dummy variable 𝑧 is distinct from all other variables.

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 28911	. . . . 5 ⊢ ((𝐻 ∈ 𝑉 ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))})
11	2, 3, 4, 10	syl3anc 1370	. . . 4 ⊢ (𝜑 → (𝑋𝐼𝑌) = {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))})
12	11	eleq2d 2825	. . 3 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))}))
13		oveq1 7438	. . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑧 − 𝑋) = (𝑍 − 𝑋))
14	13	eqeq1d 2737	. . . . 5 ⊢ (𝑧 = 𝑍 → ((𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)) ↔ (𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))
15	14	rexbidv 3177	. . . 4 ⊢ (𝑧 = 𝑍 → (∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋)) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))
16	15	elrab 3695	. . 3 ⊢ (𝑍 ∈ {𝑧 ∈ 𝑃 ∣ ∃𝑘 ∈ (0[,]1)(𝑧 − 𝑋) = (𝑘 · (𝑌 − 𝑋))} ↔ (𝑍 ∈ 𝑃 ∧ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))
17	12, 16	bitrdi 287	. 2 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ (𝑍 ∈ 𝑃 ∧ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋)))))
18	1, 17	mpbirand 707	1 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ ∃𝑘 ∈ (0[,]1)(𝑍 − 𝑋) = (𝑘 · (𝑌 − 𝑋))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 {crab 3433 ‘cfv 6563 (class class class)co 7431 0cc0 11153 1c1 11154 [,]cicc 13387 Basecbs 17245 ·_𝑠 cvsca 17302 -_gcsg 18966 Itvcitv 28456 toTGcttg 28896

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-dec 12732 df-sets 17198 df-slot 17216 df-ndx 17228 df-itv 28458 df-lng 28459 df-ttg 28897

This theorem is referenced by: ttgbtwnid 28913 ttgcontlem1 28914

W3C validator