Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > coltr3 | Structured version Visualization version GIF version |
Description: A transitivity law for colinearity. (Contributed by Thierry Arnoux, 27-Nov-2019.) |
Ref | Expression |
---|---|
tglineintmo.p | ⊢ 𝑃 = (Base‘𝐺) |
tglineintmo.i | ⊢ 𝐼 = (Itv‘𝐺) |
tglineintmo.l | ⊢ 𝐿 = (LineG‘𝐺) |
tglineintmo.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
coltr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
coltr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
coltr.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
coltr.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
coltr.1 | ⊢ (𝜑 → 𝐴 ∈ (𝐵𝐿𝐶)) |
coltr3.2 | ⊢ (𝜑 → 𝐷 ∈ (𝐴𝐼𝐶)) |
Ref | Expression |
---|---|
coltr3 | ⊢ (𝜑 → 𝐷 ∈ (𝐵𝐿𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tglineintmo.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
2 | eqid 2823 | . . . 4 ⊢ (dist‘𝐺) = (dist‘𝐺) | |
3 | tglineintmo.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | tglineintmo.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
5 | 4 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐺 ∈ TarskiG) |
6 | coltr.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
7 | 6 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 ∈ 𝑃) |
8 | coltr.d | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
9 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ 𝑃) |
10 | coltr3.2 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (𝐴𝐼𝐶)) | |
11 | 10 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐴𝐼𝐶)) |
12 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐶) | |
13 | 12 | oveq2d 7174 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → (𝐴𝐼𝐴) = (𝐴𝐼𝐶)) |
14 | 11, 13 | eleqtrrd 2918 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐴𝐼𝐴)) |
15 | 1, 2, 3, 5, 7, 9, 14 | axtgbtwnid 26254 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐷) |
16 | coltr.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐵𝐿𝐶)) | |
17 | 16 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 ∈ (𝐵𝐿𝐶)) |
18 | 15, 17 | eqeltrrd 2916 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐵𝐿𝐶)) |
19 | tglineintmo.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
20 | 4 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐺 ∈ TarskiG) |
21 | 6 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ∈ 𝑃) |
22 | coltr.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
23 | 22 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐶 ∈ 𝑃) |
24 | 8 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ 𝑃) |
25 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ≠ 𝐶) | |
26 | 10 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐴𝐼𝐶)) |
27 | 1, 3, 19, 20, 21, 23, 24, 25, 26 | btwnlng1 26407 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐴𝐿𝐶)) |
28 | 25 | necomd 3073 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐶 ≠ 𝐴) |
29 | coltr.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
30 | 29 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ∈ 𝑃) |
31 | 1, 19, 3, 4, 29, 22, 16 | tglngne 26338 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
32 | 31 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ≠ 𝐶) |
33 | 16 | adantr 483 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ∈ (𝐵𝐿𝐶)) |
34 | 1, 3, 19, 20, 23, 21, 30, 28, 33, 32 | lnrot1 26411 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ∈ (𝐶𝐿𝐴)) |
35 | 1, 3, 19, 20, 23, 21, 28, 30, 32, 34 | tglineelsb2 26420 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐶𝐿𝐴) = (𝐶𝐿𝐵)) |
36 | 1, 3, 19, 20, 21, 23, 25 | tglinecom 26423 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐴𝐿𝐶) = (𝐶𝐿𝐴)) |
37 | 1, 3, 19, 4, 29, 22, 31 | tglinecom 26423 | . . . . 5 ⊢ (𝜑 → (𝐵𝐿𝐶) = (𝐶𝐿𝐵)) |
38 | 37 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐵𝐿𝐶) = (𝐶𝐿𝐵)) |
39 | 35, 36, 38 | 3eqtr4d 2868 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐴𝐿𝐶) = (𝐵𝐿𝐶)) |
40 | 27, 39 | eleqtrd 2917 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐵𝐿𝐶)) |
41 | 18, 40 | pm2.61dane 3106 | 1 ⊢ (𝜑 → 𝐷 ∈ (𝐵𝐿𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 distcds 16576 TarskiGcstrkg 26218 Itvcitv 26224 LineGclng 26225 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-dju 9332 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-xnn0 11971 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-concat 13925 df-s1 13952 df-s2 14212 df-s3 14213 df-trkgc 26236 df-trkgb 26237 df-trkgcb 26238 df-trkg 26241 df-cgrg 26299 |
This theorem is referenced by: mideulem2 26522 opphllem 26523 outpasch 26543 |
Copyright terms: Public domain | W3C validator |