| 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 2769 | . . . 4 ⊢ (dist‘𝐺) = (dist‘𝐺) | |
| 3 | tglineintmo.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | tglineintmo.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐺 ∈ TarskiG) |
| 6 | coltr.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 7 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 ∈ 𝑃) |
| 8 | coltr.d | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ 𝑃) |
| 10 | coltr3.2 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (𝐴𝐼𝐶)) | |
| 11 | 10 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐴𝐼𝐶)) |
| 12 | simpr 489 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐶) | |
| 13 | 12 | oveq2d 7427 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → (𝐴𝐼𝐴) = (𝐴𝐼𝐶)) |
| 14 | 11, 13 | eleqtrrd 2872 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐴𝐼𝐴)) |
| 15 | 1, 2, 3, 5, 7, 9, 14 | axtgbtwnid 28701 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐷) |
| 16 | coltr.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐵𝐿𝐶)) | |
| 17 | 16 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 ∈ (𝐵𝐿𝐶)) |
| 18 | 15, 17 | eqeltrrd 2870 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐷 ∈ (𝐵𝐿𝐶)) |
| 19 | tglineintmo.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 20 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐺 ∈ TarskiG) |
| 21 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ∈ 𝑃) |
| 22 | coltr.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 23 | 22 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐶 ∈ 𝑃) |
| 24 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ 𝑃) |
| 25 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ≠ 𝐶) | |
| 26 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐴𝐼𝐶)) |
| 27 | 1, 3, 19, 20, 21, 23, 24, 25, 26 | btwnlng1 28854 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐴𝐿𝐶)) |
| 28 | 25 | necomd 3019 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐶 ≠ 𝐴) |
| 29 | coltr.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 30 | 29 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ∈ 𝑃) |
| 31 | 1, 19, 3, 4, 29, 22, 16 | tglngne 28785 | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
| 32 | 31 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ≠ 𝐶) |
| 33 | 16 | adantr 485 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐴 ∈ (𝐵𝐿𝐶)) |
| 34 | 1, 3, 19, 20, 23, 21, 30, 28, 33, 32 | lnrot1 28858 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐵 ∈ (𝐶𝐿𝐴)) |
| 35 | 1, 3, 19, 20, 23, 21, 28, 30, 32, 34 | tglineelsb2 28867 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐶𝐿𝐴) = (𝐶𝐿𝐵)) |
| 36 | 1, 3, 19, 20, 21, 23, 25 | tglinecom 28870 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐴𝐿𝐶) = (𝐶𝐿𝐴)) |
| 37 | 1, 3, 19, 4, 29, 22, 31 | tglinecom 28870 | . . . . 5 ⊢ (𝜑 → (𝐵𝐿𝐶) = (𝐶𝐿𝐵)) |
| 38 | 37 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐵𝐿𝐶) = (𝐶𝐿𝐵)) |
| 39 | 35, 36, 38 | 3eqtr4d 2814 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → (𝐴𝐿𝐶) = (𝐵𝐿𝐶)) |
| 40 | 27, 39 | eleqtrd 2871 | . 2 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐶) → 𝐷 ∈ (𝐵𝐿𝐶)) |
| 41 | 18, 40 | pm2.61dane 3051 | 1 ⊢ (𝜑 → 𝐷 ∈ (𝐵𝐿𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 distcds 17319 TarskiGcstrkg 28662 Itvcitv 28668 LineGclng 28669 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-oadd 8457 df-er 8694 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-xnn0 12578 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683 df-hash 14367 df-word 14551 df-concat 14608 df-s1 14634 df-s2 14885 df-s3 14886 df-trkgc 28683 df-trkgb 28684 df-trkgcb 28685 df-trkg 28688 df-cgrg 28746 |
| This theorem is referenced by: mideulem2 28974 opphllem 28975 outpasch 28996 |
| Copyright terms: Public domain | W3C validator |