MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tgcolg Structured version   Visualization version   GIF version

Theorem tgcolg 29074
Description: We choose the notation (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) instead of "colinear" in order to avoid defining an additional symbol for colinearity because LineG is a common structure slot for other axiomatizations of geometry. (Contributed by Thierry Arnoux, 25-May-2019.)
Hypotheses
Ref Expression
tglngval.p 𝑃 = (Base‘𝐺)
tglngval.l 𝐿 = (LineG‘𝐺)
tglngval.i 𝐼 = (Itv‘𝐺)
tglngval.g (𝜑 → 𝐺 ∈ TarskiG)
tglngval.x (𝜑 → 𝑋 ∈ 𝑃)
tglngval.y (𝜑 → 𝑌 ∈ 𝑃)
tgcolg.z (𝜑 → 𝑍 ∈ 𝑃)
Assertion
Ref Expression
tgcolg (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))

Proof of Theorem tgcolg
StepHypRef Expression
1 animorr 994 . . 3 ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
2 tglngval.p . . . . . 6 𝑃 = (Base‘𝐺)
3 eqid 2763 . . . . . 6 (dist‘𝐺) = (dist‘𝐺)
4 tglngval.i . . . . . 6 𝐼 = (Itv‘𝐺)
5 tglngval.g . . . . . . 7 (𝜑 → 𝐺 ∈ TarskiG)
65adantr 486 . . . . . 6 ((𝜑 ∧ 𝑋 = 𝑌) → 𝐺 ∈ TarskiG)
7 tgcolg.z . . . . . . 7 (𝜑 → 𝑍 ∈ 𝑃)
87adantr 486 . . . . . 6 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 ∈ 𝑃)
9 tglngval.x . . . . . . 7 (𝜑 → 𝑋 ∈ 𝑃)
109adantr 486 . . . . . 6 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ 𝑃)
112, 3, 4, 6, 8, 10tgbtwntriv2 29007 . . . . 5 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ (𝑍𝐼𝑋))
12 simpr 490 . . . . . 6 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
1312oveq2d 7467 . . . . 5 ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍𝐼𝑋) = (𝑍𝐼𝑌))
1411, 13eleqtrd 2866 . . . 4 ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ (𝑍𝐼𝑌))
15143mix2d 1356 . . 3 ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))
161, 152thd 268 . 2 ((𝜑 ∧ 𝑋 = 𝑌) → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
17 simpr 490 . . . . . 6 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
1817neneqd 2964 . . . . 5 ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌)
19 biorf 950 . . . . 5 (¬ 𝑋 = 𝑌 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌))))
2018, 19syl 18 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌))))
21 orcom 884 . . . 4 ((𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌)) ↔ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
2220, 21bitrdi 290 . . 3 ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)))
23 tglngval.l . . . 4 𝐿 = (LineG‘𝐺)
245adantr 486 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐺 ∈ TarskiG)
259adantr 486 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝑃)
26 tglngval.y . . . . 5 (𝜑 → 𝑌 ∈ 𝑃)
2726adantr 486 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝑃)
287adantr 486 . . . 4 ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑍 ∈ 𝑃)
292, 23, 4, 24, 25, 27, 17, 28tgellng 29073 . . 3 ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
3022, 29bitr3d 284 . 2 ((𝜑 ∧ 𝑋 ≠ 𝑌) → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
3116, 30pm2.61dane 3046 1 (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  distcds 17481  TarskiGcstrkg 28946  Itvcitv 28952  LineGclng 28953
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-trkgc 28967  df-trkgcb 28969  df-trkg 28972
This theorem is used by:  btwncolg1  29075  btwncolg2  29076  btwncolg3  29077  colcom  29078  colrot1  29079  lnxfr  29086  lnext  29087  tgfscgr  29088  tglowdim2l  29176  outpasch  29290
  Copyright terms: Public domain W3C validator