![]() |
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 757 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝜑) | |
2 | simpr 479 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) | |
3 | ttgbtwnid.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ ℂMod) | |
4 | clmlmod 23285 | . . . . . . . . 9 ⊢ (𝐻 ∈ ℂMod → 𝐻 ∈ LMod) | |
5 | 3, 4 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ LMod) |
6 | ttgelitv.x | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
7 | ttgitvval.b | . . . . . . . . 9 ⊢ 𝑃 = (Base‘𝐻) | |
8 | eqid 2778 | . . . . . . . . 9 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
9 | ttgitvval.m | . . . . . . . . 9 ⊢ − = (-g‘𝐻) | |
10 | 7, 8, 9 | lmodsubid 19326 | . . . . . . . 8 ⊢ ((𝐻 ∈ LMod ∧ 𝑋 ∈ 𝑃) → (𝑋 − 𝑋) = (0g‘𝐻)) |
11 | 5, 6, 10 | syl2anc 579 | . . . . . . 7 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐻)) |
12 | 11 | ad2antrr 716 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑋 − 𝑋) = (0g‘𝐻)) |
13 | 12 | oveq2d 6940 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (𝑋 − 𝑋)) = (𝑘 · (0g‘𝐻))) |
14 | 5 | ad2antrr 716 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝐻 ∈ LMod) |
15 | ttgbtwnid.2 | . . . . . . . 8 ⊢ (𝜑 → (0[,]1) ⊆ 𝑅) | |
16 | 15 | ad2antrr 716 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (0[,]1) ⊆ 𝑅) |
17 | simplr 759 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ (0[,]1)) | |
18 | 16, 17 | sseldd 3822 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑘 ∈ 𝑅) |
19 | eqid 2778 | . . . . . . 7 ⊢ (Scalar‘𝐻) = (Scalar‘𝐻) | |
20 | ttgitvval.s | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝐻) | |
21 | ttgbtwnid.r | . . . . . . 7 ⊢ 𝑅 = (Base‘(Scalar‘𝐻)) | |
22 | 19, 20, 21, 8 | lmodvs0 19300 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑘 ∈ 𝑅) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
23 | 14, 18, 22 | syl2anc 579 | . . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑘 · (0g‘𝐻)) = (0g‘𝐻)) |
24 | 2, 13, 23 | 3eqtrd 2818 | . . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → (𝑌 − 𝑋) = (0g‘𝐻)) |
25 | ttgelitv.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
26 | 7, 8, 9 | lmodsubeq0 19325 | . . . . . 6 ⊢ ((𝐻 ∈ LMod ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ∈ 𝑃) → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
27 | 5, 25, 6, 26 | syl3anc 1439 | . . . . 5 ⊢ (𝜑 → ((𝑌 − 𝑋) = (0g‘𝐻) ↔ 𝑌 = 𝑋)) |
28 | 27 | biimpa 470 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 − 𝑋) = (0g‘𝐻)) → 𝑌 = 𝑋) |
29 | 1, 24, 28 | syl2anc 579 | . . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ (0[,]1)) ∧ (𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) → 𝑌 = 𝑋) |
30 | 29 | eqcomd 2784 | . 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 26249 | . . 3 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑋) ↔ ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋)))) |
35 | 31, 34 | mpbid 224 | . 2 ⊢ (𝜑 → ∃𝑘 ∈ (0[,]1)(𝑌 − 𝑋) = (𝑘 · (𝑋 − 𝑋))) |
36 | 30, 35 | r19.29a 3264 | 1 ⊢ (𝜑 → 𝑋 = 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 = wceq 1601 ∈ wcel 2107 ∃wrex 3091 ⊆ wss 3792 ‘cfv 6137 (class class class)co 6924 0cc0 10274 1c1 10275 [,]cicc 12495 Basecbs 16266 Scalarcsca 16352 ·𝑠 cvsca 16353 0gc0g 16497 -gcsg 17822 LModclmod 19266 ℂModcclm 23280 Itvcitv 25804 toTGcttg 26239 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-mulcom 10338 ax-addass 10339 ax-mulass 10340 ax-distr 10341 ax-i2m1 10342 ax-1ne0 10343 ax-1rid 10344 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 ax-pre-ltadd 10350 ax-pre-mulgt0 10351 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-riota 6885 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-om 7346 df-1st 7447 df-2nd 7448 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-er 8028 df-en 8244 df-dom 8245 df-sdom 8246 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-sub 10610 df-neg 10611 df-nn 11380 df-2 11443 df-3 11444 df-4 11445 df-5 11446 df-6 11447 df-7 11448 df-8 11449 df-9 11450 df-n0 11648 df-dec 11851 df-ndx 16269 df-slot 16270 df-base 16272 df-sets 16273 df-plusg 16362 df-0g 16499 df-mgm 17639 df-sgrp 17681 df-mnd 17692 df-grp 17823 df-minusg 17824 df-sbg 17825 df-mgp 18888 df-ring 18947 df-lmod 19268 df-clm 23281 df-itv 25806 df-lng 25807 df-ttg 26240 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |