Theorem colcom 28908

Description: Swapping the points defining a line keeps it unchanged. Part of Theorem 4.11 of [Schwabhauser] p. 34. (Contributed by Thierry Arnoux, 3-Apr-2019.)

Hypotheses

Ref	Expression
tglngval.p	⊢ 𝑃 = (Base‘𝐺)
tglngval.l	⊢ 𝐿 = (LineG‘𝐺)
tglngval.i	⊢ 𝐼 = (Itv‘𝐺)
tglngval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
tglngval.x	⊢ (𝜑 → 𝑋 ∈ 𝑃)
tglngval.y	⊢ (𝜑 → 𝑌 ∈ 𝑃)
tgcolg.z	⊢ (𝜑 → 𝑍 ∈ 𝑃)
colrot	⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))

Assertion

Ref	Expression
colcom	⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋))

Proof of Theorem colcom

Step	Hyp	Ref	Expression
1		colrot	. 2 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌))
2		3orcomb 1110	. . . 4 ⊢ ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌)))
3		tglngval.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
4		eqid 2762	. . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺)
5		tglngval.i	. . . . . 6 ⊢ 𝐼 = (Itv‘𝐺)
6		tglngval.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7		tglngval.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
8		tgcolg.z	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
9		tglngval.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
10	3, 4, 5, 6, 7, 8, 9	tgbtwncomb 28839	. . . . 5 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑌𝐼𝑋)))
11	3, 4, 5, 6, 7, 9, 8	tgbtwncomb 28839	. . . . 5 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ 𝑌 ∈ (𝑍𝐼𝑋)))
12	3, 4, 5, 6, 8, 7, 9	tgbtwncomb 28839	. . . . 5 ⊢ (𝜑 → (𝑋 ∈ (𝑍𝐼𝑌) ↔ 𝑋 ∈ (𝑌𝐼𝑍)))
13	10, 11, 12	3orbi123d 1463	. . . 4 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍))))
14	2, 13	bitrid 286	. . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍))))
15		tglngval.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
16	3, 15, 5, 6, 7, 9, 8	tgcolg 28904	. . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍))))
17	3, 15, 5, 6, 9, 7, 8	tgcolg 28904	. . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍))))
18	14, 16, 17	3bitr4d 314	. 2 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)))
19	1, 18	mpbid 235	1 ⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋))

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   ∨ w3o 1102   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  distcds 17357  TarskiGcstrkg 28776  Itvcitv 28782  LineGclng 28783

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-trkgc 28797  df-trkgb 28798  df-trkgcb 28799  df-trkg 28802

This theorem is used by:  ncolcom  28911  tglineeltr  28986  mirtrcgr  29042  symquadlem  29048  midexlem  29051  symquadprlnglem  29052  colperpexlem1  29093  mideulem2  29097  opphllem  29098  hlpasch  29121  colhp  29135  trgcopy  29198  tgaaddcpbllem1  29236  tgaaddcpbl  29239  tgaaddcpbl2  29240  cgrg3col4  29259  tgasa1  29290  symquadprlng  29327