Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ttgbtwnid | Structured version Visualization version GIF version |
Description: Any subcomplex module equipped with the betweenness operation fulfills the identity of betweenness (Axiom A6). (Contributed by Thierry Arnoux, 26-Mar-2019.) |
Ref | Expression |
---|---|
ttgval.n | ⊢ 𝐺 = (toTG‘𝐻) |
ttgitvval.i | ⊢ 𝐼 = (Itv‘𝐺) |
ttgitvval.b | ⊢ 𝑃 = (Base‘𝐻) |
ttgitvval.m | ⊢ − = (-g‘𝐻) |
ttgitvval.s | ⊢ · = ( ·𝑠 ‘𝐻) |
ttgelitv.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
ttgelitv.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
ttgbtwnid.r | ⊢ 𝑅 = (Base‘(Scalar‘𝐻)) |
ttgbtwnid.2 | ⊢ (𝜑 → (0[,]1) ⊆ 𝑅) |
ttgbtwnid.1 | ⊢ (𝜑 → 𝐻 ∈ ℂMod) |
ttgbtwnid.y | ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼𝑋)) |
Ref | Expression |
---|---|
ttgbtwnid | ⊢ (𝜑 → 𝑋 = 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 765 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝜑) | |
2 | simpr 487 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) | |
3 | ttgbtwnid.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ ℂMod) | |
4 | clmlmod 23670 | . . . . . . . . 9 ⊢ (𝐻 ∈ ℂMod → 𝐻 ∈ LMod) | |
5 | 3, 4 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ LMod) |
6 | ttgelitv.x | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
7 | ttgitvval.b | . . . . . . . . 9 ⊢ 𝑃 = (Base‘𝐻) | |
8 | eqid 2821 | . . . . . . . . 9 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
9 | ttgitvval.m | . . . . . . . . 9 ⊢ − = (-g‘𝐻) | |
10 | 7, 8, 9 | lmodsubid 19693 | . . . . . . . 8 ⊢ ((𝐻 ∈ LMod ∧ 𝑋 ∈ 𝑃) → (𝑋 − 𝑋) = (0g‘𝐻)) |
11 | 5, 6, 10 | syl2anc 586 | . . . . . . 7 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐻)) |
12 | 11 | ad2antrr 724 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑋 − 𝑋) = (0g‘𝐻)) |
13 | 12 | oveq2d 7171 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (𝑋 − 𝑋)) = (𝑘 · (0g‘𝐻))) |
14 | 5 | ad2antrr 724 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝐻 ∈ LMod) |
15 | ttgbtwnid.2 | . . . . . . . 8 ⊢ (𝜑 → (0[,]1) ⊆ 𝑅) | |
16 | 15 | ad2antrr 724 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (0[,]1) ⊆ 𝑅) |
17 | simplr 767 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ (0[,]1)) | |
18 | 16, 17 | sseldd 3967 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ 𝑅) |
19 | eqid 2821 | . . . . . . 7 ⊢ (Scalar‘𝐻) = (Scalar‘𝐻) | |
20 | ttgitvval.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝐻) | |
21 | ttgbtwnid.r | . . . . . . 7 ⊢ 𝑅 = (Base‘(Scalar‘𝐻)) | |
22 | 19, 20, 21, 8 | lmodvs0 19667 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑘 ∈ 𝑅) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
23 | 14, 18, 22 | syl2anc 586 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
24 | 2, 13, 23 | 3eqtrd 2860 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (0g‘𝐻)) |
25 | ttgelitv.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
26 | 7, 8, 9 | lmodsubeq0 19692 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ∈ 𝑃) → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
27 | 5, 25, 6, 26 | syl3anc 1367 | . . . . 5 ⊢ (𝜑 → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
28 | 27 | biimpa 479 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 − 𝑋) = (0g‘𝐻)) → 𝑌 = 𝑋) |
29 | 1, 24, 28 | syl2anc 586 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑌 = 𝑋) |
30 | 29 | eqcomd 2827 | . 2 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑋 = 𝑌) |
31 | ttgbtwnid.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼𝑋)) | |
32 | ttgval.n | . . . 4 ⊢ 𝐺 = (toTG‘𝐻) | |
33 | ttgitvval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
34 | 32, 33, 7, 9, 20, 6, 6, 3, 25 | ttgelitv 26668 | . . 3 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑋) ↔ ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋)))) |
35 | 31, 34 | mpbid 234 | . 2 ⊢ (𝜑 → ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) |
36 | 30, 35 | r19.29a 3289 | 1 ⊢ (𝜑 → 𝑋 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 ⊆ wss 3935 ‘cfv 6354 (class class class)co 7155 0cc0 10536 1c1 10537 [,]cicc 12740 Basecbs 16482 Scalarcsca 16567 ·𝑠 cvsca 16568 0gc0g 16712 -gcsg 18104 LModclmod 19633 ℂModcclm 23665 Itvcitv 26221 toTGcttg 26658 |
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 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-5 11702 df-6 11703 df-7 11704 df-8 11705 df-9 11706 df-n0 11897 df-dec 12098 df-ndx 16485 df-slot 16486 df-base 16488 df-sets 16489 df-plusg 16577 df-0g 16714 df-mgm 17851 df-sgrp 17900 df-mnd 17911 df-grp 18105 df-minusg 18106 df-sbg 18107 df-mgp 19239 df-ring 19298 df-lmod 19635 df-clm 23666 df-itv 26223 df-lng 26224 df-ttg 26659 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |