Theorem tgcolg 26819

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

Step	Hyp	Ref	Expression
1		animorr 975	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
2		tglngval.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
3		eqid 2738	. . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺)
4		tglngval.i	. . . . . 6 ⊢ 𝐼 = (Itv‘𝐺)
5		tglngval.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
6	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝐺 ∈ TarskiG)
7		tgcolg.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
8	7	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑍 ∈ 𝑃)
9		tglngval.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
10	9	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ 𝑃)
11	2, 3, 4, 6, 8, 10	tgbtwntriv2 26752	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ (𝑍𝐼𝑋))
12		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
13	12	oveq2d 7271	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍𝐼𝑋) = (𝑍𝐼𝑌))
14	11, 13	eleqtrd 2841	. . . 4 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → 𝑋 ∈ (𝑍𝐼𝑌))
15	14	3mix2d 1335	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))
16	1, 15	2thd 264	. 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
17		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ≠ 𝑌)
18	17	neneqd 2947	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ¬ 𝑋 = 𝑌)
19		biorf 933	. . . . 5 ⊢ (¬ 𝑋 = 𝑌 → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌))))
20	18, 19	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌))))
21		orcom 866	. . . 4 ⊢ ((𝑋 = 𝑌 ∨ 𝑍 ∈ (𝑋𝐿𝑌)) ↔ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
22	20, 21	bitrdi 286	. . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)))
23		tglngval.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
24	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝐺 ∈ TarskiG)
25	9	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑋 ∈ 𝑃)
26		tglngval.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
27	26	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑌 ∈ 𝑃)
28	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → 𝑍 ∈ 𝑃)
29	2, 23, 4, 24, 25, 27, 17, 28	tgellng 26818	. . 3 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → (𝑍 ∈ (𝑋𝐿𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
30	22, 29	bitr3d 280	. 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
31	16, 30	pm2.61dane 3031	1 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∨ w3o 1084   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ‘cfv 6418  (class class class)co 7255  Basecbs 16840  distcds 16897  TarskiGcstrkg 26693  Itvcitv 26699  LineGclng 26700

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-trkgc 26713  df-trkgcb 26715  df-trkg 26718

This theorem is referenced by:  btwncolg1  26820  btwncolg2  26821  btwncolg3  26822  colcom  26823  colrot1  26824  lnxfr  26831  lnext  26832  tgfscgr  26833  tglowdim2l  26915  outpasch  27020