Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tgidinside | Structured version Visualization version GIF version |
Description: Law for finding a point inside a segment. Theorem 4.19 of [Schwabhauser] p. 38. (Contributed by Thierry Arnoux, 28-Apr-2019.) |
Ref | Expression |
---|---|
tglngval.p | ⊢ 𝑃 = (Base‘𝐺) |
tglngval.l | ⊢ 𝐿 = (LineG‘𝐺) |
tglngval.i | ⊢ 𝐼 = (Itv‘𝐺) |
tglngval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
tglngval.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
tglngval.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
tgcolg.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
lnxfr.r | ⊢ ∼ = (cgrG‘𝐺) |
lnxfr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
lnxfr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
lnxfr.d | ⊢ − = (dist‘𝐺) |
tgidinside.1 | ⊢ (𝜑 → 𝑍 ∈ (𝑋𝐼𝑌)) |
tgidinside.2 | ⊢ (𝜑 → (𝑋 − 𝑍) = (𝑋 − 𝐴)) |
tgidinside.3 | ⊢ (𝜑 → (𝑌 − 𝑍) = (𝑌 − 𝐴)) |
Ref | Expression |
---|---|
tgidinside | ⊢ (𝜑 → 𝑍 = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tglngval.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
2 | lnxfr.d | . . . 4 ⊢ − = (dist‘𝐺) | |
3 | tglngval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | tglngval.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | 4 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝐺 ∈ TarskiG) |
6 | tglngval.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
7 | 6 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ 𝑃) |
8 | tgcolg.z | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
9 | 8 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 ∈ 𝑃) |
10 | tgidinside.1 | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ (𝑋𝐼𝑌)) | |
11 | 10 | adantr 481 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 ∈ (𝑋𝐼𝑌)) |
12 | simpr 477 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌) | |
13 | 12 | oveq2d 6666 | . . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑋𝐼𝑋) = (𝑋𝐼𝑌)) |
14 | 11, 13 | eleqtrrd 2704 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 ∈ (𝑋𝐼𝑋)) |
15 | 1, 2, 3, 5, 7, 9, 14 | axtgbtwnid 25365 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑍) |
16 | lnxfr.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
17 | 16 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝐴 ∈ 𝑃) |
18 | tgidinside.2 | . . . . 5 ⊢ (𝜑 → (𝑋 − 𝑍) = (𝑋 − 𝐴)) | |
19 | 18 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑋 − 𝑍) = (𝑋 − 𝐴)) |
20 | 1, 2, 3, 5, 7, 9, 7, 17, 19, 15 | tgcgreq 25377 | . . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝐴) |
21 | 15, 20 | eqtr3d 2658 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 = 𝐴) |
22 | tglngval.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
23 | 4 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐺 ∈ TarskiG) |
24 | 6 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝑃) |
25 | tglngval.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
26 | 25 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝑃) |
27 | 8 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑍 ∈ 𝑃) |
28 | lnxfr.r | . . 3 ⊢ ∼ = (cgrG‘𝐺) | |
29 | 16 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐴 ∈ 𝑃) |
30 | lnxfr.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
31 | 30 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐵 ∈ 𝑃) |
32 | simpr 477 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌) | |
33 | 1, 22, 3, 4, 6, 8, 25, 10 | btwncolg3 25452 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐿𝑍) ∨ 𝑋 = 𝑍)) |
34 | 33 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑌 ∈ (𝑋𝐿𝑍) ∨ 𝑋 = 𝑍)) |
35 | 18 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑋 − 𝑍) = (𝑋 − 𝐴)) |
36 | tgidinside.3 | . . . 4 ⊢ (𝜑 → (𝑌 − 𝑍) = (𝑌 − 𝐴)) | |
37 | 36 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑌 − 𝑍) = (𝑌 − 𝐴)) |
38 | 1, 22, 3, 23, 24, 26, 27, 28, 29, 31, 2, 32, 34, 35, 37 | lnid 25465 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑍 = 𝐴) |
39 | 21, 38 | pm2.61dane 2881 | 1 ⊢ (𝜑 → 𝑍 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 383 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 distcds 15950 TarskiGcstrkg 25329 Itvcitv 25335 LineGclng 25336 cgrGccgrg 25405 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-s2 13593 df-s3 13594 df-trkgc 25347 df-trkgb 25348 df-trkgcb 25349 df-trkg 25352 df-cgrg 25406 |
This theorem is referenced by: miduniq 25580 ragflat2 25598 |
Copyright terms: Public domain | W3C validator |