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

Theorem cgraswap 28896
Description: Swap rays in a congruence relation. Theorem 11.9 of [Schwabhauser] p. 96. (Contributed by Thierry Arnoux, 5-Mar-2020.)
Hypotheses
Ref Expression
cgraid.p 𝑃 = (Base‘𝐺)
cgraid.i 𝐼 = (Itv‘𝐺)
cgraid.g (𝜑𝐺 ∈ TarskiG)
cgraid.k 𝐾 = (hlG‘𝐺)
cgraid.a (𝜑𝐴𝑃)
cgraid.b (𝜑𝐵𝑃)
cgraid.c (𝜑𝐶𝑃)
cgraid.1 (𝜑𝐴𝐵)
cgraid.2 (𝜑𝐵𝐶)
Assertion
Ref Expression
cgraswap (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐶𝐵𝐴”⟩)

Proof of Theorem cgraswap
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cgraid.p . . . . 5 𝑃 = (Base‘𝐺)
2 eqid 2737 . . . . 5 (dist‘𝐺) = (dist‘𝐺)
3 eqid 2737 . . . . 5 (cgrG‘𝐺) = (cgrG‘𝐺)
4 cgraid.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
54ad3antrrr 731 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝐺 ∈ TarskiG)
6 cgraid.a . . . . . 6 (𝜑𝐴𝑃)
76ad3antrrr 731 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝐴𝑃)
8 cgraid.b . . . . . 6 (𝜑𝐵𝑃)
98ad3antrrr 731 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝐵𝑃)
10 cgraid.c . . . . . 6 (𝜑𝐶𝑃)
1110ad3antrrr 731 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝐶𝑃)
12 simpllr 776 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝑥𝑃)
13 simplr 769 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝑦𝑃)
14 cgraid.i . . . . . . 7 𝐼 = (Itv‘𝐺)
15 simprlr 780 . . . . . . 7 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴))
161, 2, 14, 5, 9, 12, 9, 7, 15tgcgrcomlr 28556 . . . . . 6 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥(dist‘𝐺)𝐵) = (𝐴(dist‘𝐺)𝐵))
1716eqcomd 2743 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐴(dist‘𝐺)𝐵) = (𝑥(dist‘𝐺)𝐵))
18 simprrr 782 . . . . . 6 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶))
1918eqcomd 2743 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐵(dist‘𝐺)𝐶) = (𝐵(dist‘𝐺)𝑦))
20 eqid 2737 . . . . . . . 8 (LineG‘𝐺) = (LineG‘𝐺)
21 cgraid.k . . . . . . . . . . 11 𝐾 = (hlG‘𝐺)
22 simprll 779 . . . . . . . . . . 11 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝑥(𝐾𝐵)𝐶)
231, 14, 21, 12, 11, 9, 5, 20, 22hlln 28683 . . . . . . . . . 10 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝑥 ∈ (𝐶(LineG‘𝐺)𝐵))
2423orcd 874 . . . . . . . . 9 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥 ∈ (𝐶(LineG‘𝐺)𝐵) ∨ 𝐶 = 𝐵))
251, 20, 14, 5, 11, 9, 12, 24colrot1 28635 . . . . . . . 8 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐶 ∈ (𝐵(LineG‘𝐺)𝑥) ∨ 𝐵 = 𝑥))
26 eqid 2737 . . . . . . . . . 10 (≤G‘𝐺) = (≤G‘𝐺)
271, 14, 21, 12, 11, 9, 5ishlg 28678 . . . . . . . . . . . . 13 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥(𝐾𝐵)𝐶 ↔ (𝑥𝐵𝐶𝐵 ∧ (𝑥 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝑥)))))
2822, 27mpbid 232 . . . . . . . . . . . 12 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥𝐵𝐶𝐵 ∧ (𝑥 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝑥))))
2928simp3d 1145 . . . . . . . . . . 11 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝑥)))
3029orcomd 872 . . . . . . . . . 10 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐶 ∈ (𝐵𝐼𝑥) ∨ 𝑥 ∈ (𝐵𝐼𝐶)))
31 simprrl 781 . . . . . . . . . . . 12 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝑦(𝐾𝐵)𝐴)
321, 14, 21, 13, 7, 9, 5ishlg 28678 . . . . . . . . . . . 12 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑦(𝐾𝐵)𝐴 ↔ (𝑦𝐵𝐴𝐵 ∧ (𝑦 ∈ (𝐵𝐼𝐴) ∨ 𝐴 ∈ (𝐵𝐼𝑦)))))
3331, 32mpbid 232 . . . . . . . . . . 11 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑦𝐵𝐴𝐵 ∧ (𝑦 ∈ (𝐵𝐼𝐴) ∨ 𝐴 ∈ (𝐵𝐼𝑦))))
3433simp3d 1145 . . . . . . . . . 10 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑦 ∈ (𝐵𝐼𝐴) ∨ 𝐴 ∈ (𝐵𝐼𝑦)))
351, 2, 14, 26, 5, 9, 11, 12, 9, 9, 13, 7, 30, 34, 19, 15tgcgrsub2 28671 . . . . . . . . 9 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐶(dist‘𝐺)𝑥) = (𝑦(dist‘𝐺)𝐴))
361, 2, 3, 5, 9, 11, 12, 9, 13, 7, 19, 35, 16trgcgr 28592 . . . . . . . 8 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → ⟨“𝐵𝐶𝑥”⟩(cgrG‘𝐺)⟨“𝐵𝑦𝐴”⟩)
371, 2, 14, 5, 11, 13axtgcgrrflx 28538 . . . . . . . 8 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐶(dist‘𝐺)𝑦) = (𝑦(dist‘𝐺)𝐶))
38 cgraid.2 . . . . . . . . 9 (𝜑𝐵𝐶)
3938ad3antrrr 731 . . . . . . . 8 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → 𝐵𝐶)
401, 20, 14, 5, 9, 11, 12, 3, 9, 13, 2, 13, 7, 11, 25, 36, 18, 37, 39tgfscgr 28644 . . . . . . 7 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑥(dist‘𝐺)𝑦) = (𝐴(dist‘𝐺)𝐶))
411, 2, 14, 5, 12, 13, 7, 11, 40tgcgrcomlr 28556 . . . . . 6 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝑦(dist‘𝐺)𝑥) = (𝐶(dist‘𝐺)𝐴))
4241eqcomd 2743 . . . . 5 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (𝐶(dist‘𝐺)𝐴) = (𝑦(dist‘𝐺)𝑥))
431, 2, 3, 5, 7, 9, 11, 12, 9, 13, 17, 19, 42trgcgr 28592 . . . 4 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐵𝑦”⟩)
4443, 22, 313jca 1129 . . 3 ((((𝜑𝑥𝑃) ∧ 𝑦𝑃) ∧ ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐵𝑦”⟩ ∧ 𝑥(𝐾𝐵)𝐶𝑦(𝐾𝐵)𝐴))
4538necomd 2988 . . . . 5 (𝜑𝐶𝐵)
46 cgraid.1 . . . . . 6 (𝜑𝐴𝐵)
4746necomd 2988 . . . . 5 (𝜑𝐵𝐴)
481, 14, 21, 8, 8, 6, 4, 10, 2, 45, 47hlcgrex 28692 . . . 4 (𝜑 → ∃𝑥𝑃 (𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)))
491, 14, 21, 8, 8, 10, 4, 6, 2, 46, 38hlcgrex 28692 . . . 4 (𝜑 → ∃𝑦𝑃 (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶)))
50 reeanv 3209 . . . 4 (∃𝑥𝑃𝑦𝑃 ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶))) ↔ (∃𝑥𝑃 (𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ ∃𝑦𝑃 (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶))))
5148, 49, 50sylanbrc 584 . . 3 (𝜑 → ∃𝑥𝑃𝑦𝑃 ((𝑥(𝐾𝐵)𝐶 ∧ (𝐵(dist‘𝐺)𝑥) = (𝐵(dist‘𝐺)𝐴)) ∧ (𝑦(𝐾𝐵)𝐴 ∧ (𝐵(dist‘𝐺)𝑦) = (𝐵(dist‘𝐺)𝐶))))
5244, 51reximddv2 3196 . 2 (𝜑 → ∃𝑥𝑃𝑦𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐵𝑦”⟩ ∧ 𝑥(𝐾𝐵)𝐶𝑦(𝐾𝐵)𝐴))
531, 14, 21, 4, 6, 8, 10, 10, 8, 6iscgra 28885 . 2 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐶𝐵𝐴”⟩ ↔ ∃𝑥𝑃𝑦𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐵𝑦”⟩ ∧ 𝑥(𝐾𝐵)𝐶𝑦(𝐾𝐵)𝐴)))
5452, 53mpbird 257 1 (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐶𝐵𝐴”⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2933  wrex 3061   class class class wbr 5099  cfv 6493  (class class class)co 7360  ⟨“cs3 14769  Basecbs 17140  distcds 17190  TarskiGcstrkg 28503  Itvcitv 28509  LineGclng 28510  cgrGccgrg 28586  ≤Gcleg 28658  hlGchlg 28676  cgrAccgra 28883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-1o 8399  df-oadd 8403  df-er 8637  df-map 8769  df-pm 8770  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-dju 9817  df-card 9855  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12150  df-2 12212  df-3 12213  df-n0 12406  df-xnn0 12479  df-z 12493  df-uz 12756  df-fz 13428  df-fzo 13575  df-hash 14258  df-word 14441  df-concat 14498  df-s1 14524  df-s2 14775  df-s3 14776  df-trkgc 28524  df-trkgb 28525  df-trkgcb 28526  df-trkg 28529  df-cgrg 28587  df-leg 28659  df-hlg 28677  df-cgra 28884
This theorem is referenced by:  cgraswaplr  28901  oacgr  28908  tgasa1  28934
  Copyright terms: Public domain W3C validator