Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > legbtwn | Structured version Visualization version GIF version |
Description: Deduce betweenness from "less than" relation. Corresponds loosely to Proposition 6.13 of [Schwabhauser] p. 45. (Contributed by Thierry Arnoux, 25-Aug-2019.) |
Ref | Expression |
---|---|
legval.p | ⊢ 𝑃 = (Base‘𝐺) |
legval.d | ⊢ − = (dist‘𝐺) |
legval.i | ⊢ 𝐼 = (Itv‘𝐺) |
legval.l | ⊢ ≤ = (≤G‘𝐺) |
legval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
legid.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
legid.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
legtrd.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
legtrd.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
legbtwn.1 | ⊢ (𝜑 → (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) |
legbtwn.2 | ⊢ (𝜑 → (𝐶 − 𝐴) ≤ (𝐶 − 𝐵)) |
Ref | Expression |
---|---|
legbtwn | ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 476 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝐶𝐼𝐵)) → 𝐴 ∈ (𝐶𝐼𝐵)) | |
2 | legval.p | . . . . 5 ⊢ 𝑃 = (Base‘𝐺) | |
3 | legval.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
4 | legval.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
5 | legval.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐺 ∈ TarskiG) |
7 | legid.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
8 | 7 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐴 ∈ 𝑃) |
9 | legid.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
10 | 9 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐵 ∈ 𝑃) |
11 | legtrd.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
12 | 11 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐶 ∈ 𝑃) |
13 | simpr 476 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐵 ∈ (𝐶𝐼𝐴)) | |
14 | 2, 3, 4, 6, 12, 10, 8, 13 | tgbtwncom 25183 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐵 ∈ (𝐴𝐼𝐶)) |
15 | 2, 3, 4, 6, 10, 12 | tgbtwntriv1 25186 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐵 ∈ (𝐵𝐼𝐶)) |
16 | legval.l | . . . . . . . 8 ⊢ ≤ = (≤G‘𝐺) | |
17 | legbtwn.2 | . . . . . . . . 9 ⊢ (𝜑 → (𝐶 − 𝐴) ≤ (𝐶 − 𝐵)) | |
18 | 17 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐶 − 𝐴) ≤ (𝐶 − 𝐵)) |
19 | 2, 3, 4, 16, 6, 12, 10, 8, 13 | btwnleg 25283 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐶 − 𝐵) ≤ (𝐶 − 𝐴)) |
20 | 2, 3, 4, 16, 6, 12, 8, 12, 10, 18, 19 | legtri3 25285 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐶 − 𝐴) = (𝐶 − 𝐵)) |
21 | 2, 3, 4, 6, 12, 8, 12, 10, 20 | tgcgrcomlr 25175 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐴 − 𝐶) = (𝐵 − 𝐶)) |
22 | eqidd 2611 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐵 − 𝐶) = (𝐵 − 𝐶)) | |
23 | 2, 3, 4, 6, 8, 10, 12, 10, 10, 12, 14, 15, 21, 22 | tgcgrsub 25204 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐴 − 𝐵) = (𝐵 − 𝐵)) |
24 | 2, 3, 4, 6, 8, 10, 10, 23 | axtgcgrid 25162 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐴 = 𝐵) |
25 | 24, 13 | eqeltrd 2688 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐴 ∈ (𝐶𝐼𝐴)) |
26 | 24 | oveq2d 6565 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → (𝐶𝐼𝐴) = (𝐶𝐼𝐵)) |
27 | 25, 26 | eleqtrd 2690 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐶𝐼𝐴)) → 𝐴 ∈ (𝐶𝐼𝐵)) |
28 | legbtwn.1 | . 2 ⊢ (𝜑 → (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) | |
29 | 1, 27, 28 | mpjaodan 823 | 1 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 382 ∧ wa 383 = wceq 1475 ∈ wcel 1977 class class class wbr 4583 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 distcds 15777 TarskiGcstrkg 25129 Itvcitv 25135 ≤Gcleg 25277 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 df-hash 12980 df-word 13154 df-concat 13156 df-s1 13157 df-s2 13444 df-s3 13445 df-trkgc 25147 df-trkgb 25148 df-trkgcb 25149 df-trkg 25152 df-cgrg 25206 df-leg 25278 |
This theorem is referenced by: tgcgrsub2 25290 krippenlem 25385 |
Copyright terms: Public domain | W3C validator |