![]() |
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 766 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝜑) | |
2 | simpr 488 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) | |
3 | ttgbtwnid.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ ℂMod) | |
4 | clmlmod 23672 | . . . . . . . . 9 ⊢ (𝐻 ∈ ℂMod → 𝐻 ∈ LMod) | |
5 | 3, 4 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ LMod) |
6 | ttgelitv.x | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
7 | ttgitvval.b | . . . . . . . . 9 ⊢ 𝑃 = (Base‘𝐻) | |
8 | eqid 2798 | . . . . . . . . 9 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
9 | ttgitvval.m | . . . . . . . . 9 ⊢ − = (-g‘𝐻) | |
10 | 7, 8, 9 | lmodsubid 19687 | . . . . . . . 8 ⊢ ((𝐻 ∈ LMod ∧ 𝑋 ∈ 𝑃) → (𝑋 − 𝑋) = (0g‘𝐻)) |
11 | 5, 6, 10 | syl2anc 587 | . . . . . . 7 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐻)) |
12 | 11 | ad2antrr 725 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑋 − 𝑋) = (0g‘𝐻)) |
13 | 12 | oveq2d 7151 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (𝑋 − 𝑋)) = (𝑘 · (0g‘𝐻))) |
14 | 5 | ad2antrr 725 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝐻 ∈ LMod) |
15 | ttgbtwnid.2 | . . . . . . . 8 ⊢ (𝜑 → (0[,]1) ⊆ 𝑅) | |
16 | 15 | ad2antrr 725 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (0[,]1) ⊆ 𝑅) |
17 | simplr 768 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ (0[,]1)) | |
18 | 16, 17 | sseldd 3916 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ 𝑅) |
19 | eqid 2798 | . . . . . . 7 ⊢ (Scalar‘𝐻) = (Scalar‘𝐻) | |
20 | ttgitvval.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝐻) | |
21 | ttgbtwnid.r | . . . . . . 7 ⊢ 𝑅 = (Base‘(Scalar‘𝐻)) | |
22 | 19, 20, 21, 8 | lmodvs0 19661 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑘 ∈ 𝑅) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
23 | 14, 18, 22 | syl2anc 587 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
24 | 2, 13, 23 | 3eqtrd 2837 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (0g‘𝐻)) |
25 | ttgelitv.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
26 | 7, 8, 9 | lmodsubeq0 19686 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ∈ 𝑃) → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
27 | 5, 25, 6, 26 | syl3anc 1368 | . . . . 5 ⊢ (𝜑 → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
28 | 27 | biimpa 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 − 𝑋) = (0g‘𝐻)) → 𝑌 = 𝑋) |
29 | 1, 24, 28 | syl2anc 587 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑌 = 𝑋) |
30 | 29 | eqcomd 2804 | . 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 26677 | . . 3 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑋) ↔ ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋)))) |
35 | 31, 34 | mpbid 235 | . 2 ⊢ (𝜑 → ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) |
36 | 30, 35 | r19.29a 3248 | 1 ⊢ (𝜑 → 𝑋 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∃wrex 3107 ⊆ wss 3881 ‘cfv 6324 (class class class)co 7135 0cc0 10526 1c1 10527 [,]cicc 12729 Basecbs 16475 Scalarcsca 16560 ·𝑠 cvsca 16561 0gc0g 16705 -gcsg 18097 LModclmod 19627 ℂModcclm 23667 Itvcitv 26230 toTGcttg 26667 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-dec 12087 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-plusg 16570 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-sbg 18100 df-mgp 19233 df-ring 19292 df-lmod 19629 df-clm 23668 df-itv 26232 df-lng 26233 df-ttg 26668 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |