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

Theorem tgellng 25365
 Description: Property of lying on the line going through points 𝑋 and 𝑌. Definition 4.10 of [Schwabhauser] p. 36. We choose the notation 𝑍 ∈ (𝑋(LineG‘𝐺)𝑌) instead of "colinear" because LineG is a common structure slot for other axiomatizations of geometry. (Contributed by Thierry Arnoux, 28-Mar-2019.)
Hypotheses
Ref Expression
tglngval.p 𝑃 = (Base‘𝐺)
tglngval.l 𝐿 = (LineG‘𝐺)
tglngval.i 𝐼 = (Itv‘𝐺)
tglngval.g (𝜑𝐺 ∈ TarskiG)
tglngval.x (𝜑𝑋𝑃)
tglngval.y (𝜑𝑌𝑃)
tglngval.z (𝜑𝑋𝑌)
tgellng.z (𝜑𝑍𝑃)
Assertion
Ref Expression
tgellng (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))

Proof of Theorem tgellng
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 tglngval.p . . . . 5 𝑃 = (Base‘𝐺)
2 tglngval.l . . . . 5 𝐿 = (LineG‘𝐺)
3 tglngval.i . . . . 5 𝐼 = (Itv‘𝐺)
4 tglngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
5 tglngval.x . . . . 5 (𝜑𝑋𝑃)
6 tglngval.y . . . . 5 (𝜑𝑌𝑃)
7 tglngval.z . . . . 5 (𝜑𝑋𝑌)
81, 2, 3, 4, 5, 6, 7tglngval 25363 . . . 4 (𝜑 → (𝑋𝐿𝑌) = {𝑧𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))})
98eleq2d 2684 . . 3 (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ 𝑍 ∈ {𝑧𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))}))
10 eleq1 2686 . . . . 5 (𝑧 = 𝑍 → (𝑧 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑋𝐼𝑌)))
11 oveq1 6617 . . . . . 6 (𝑧 = 𝑍 → (𝑧𝐼𝑌) = (𝑍𝐼𝑌))
1211eleq2d 2684 . . . . 5 (𝑧 = 𝑍 → (𝑋 ∈ (𝑧𝐼𝑌) ↔ 𝑋 ∈ (𝑍𝐼𝑌)))
13 oveq2 6618 . . . . . 6 (𝑧 = 𝑍 → (𝑋𝐼𝑧) = (𝑋𝐼𝑍))
1413eleq2d 2684 . . . . 5 (𝑧 = 𝑍 → (𝑌 ∈ (𝑋𝐼𝑧) ↔ 𝑌 ∈ (𝑋𝐼𝑍)))
1510, 12, 143orbi123d 1395 . . . 4 (𝑧 = 𝑍 → ((𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
1615elrab 3350 . . 3 (𝑍 ∈ {𝑧𝑃 ∣ (𝑧 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑧𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑧))} ↔ (𝑍𝑃 ∧ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
179, 16syl6bb 276 . 2 (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍𝑃 ∧ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))))
18 tgellng.z . . 3 (𝜑𝑍𝑃)
1918biantrurd 529 . 2 (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍𝑃 ∧ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))))
2017, 19bitr4d 271 1 (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∨ w3o 1035   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  {crab 2911  ‘cfv 5852  (class class class)co 6610  Basecbs 15792  TarskiGcstrkg 25246  Itvcitv 25252  LineGclng 25253 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pr 4872 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-sbc 3422  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-br 4619  df-opab 4679  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-iota 5815  df-fun 5854  df-fv 5860  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-trkg 25269 This theorem is referenced by:  tgcolg  25366  hlln  25419  lnhl  25427  btwnlng1  25431  btwnlng2  25432  btwnlng3  25433  lncom  25434  lnrot1  25435  lnrot2  25436  tglineeltr  25443  colmid  25500  cgracol  25636
 Copyright terms: Public domain W3C validator