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

Theorem tgasa1 29460
Description: Second congruence theorem: ASA. (Angle-Side-Angle): If two pairs of angles of two triangles are equal in measurement, and the included sides are equal in length, then the triangles are congruent. Theorem 11.50 of [Schwabhauser] p. 108. (Contributed by Thierry Arnoux, 15-Aug-2020.)
Hypotheses
Ref Expression
tgsas.p 𝑃 = (Base‘𝐺)
tgsas.m − = (dist‘𝐺)
tgsas.i 𝐼 = (Itv‘𝐺)
tgsas.g (𝜑 → 𝐺 ∈ TarskiG)
tgsas.a (𝜑 → 𝐴 ∈ 𝑃)
tgsas.b (𝜑 → 𝐵 ∈ 𝑃)
tgsas.c (𝜑 → 𝐶 ∈ 𝑃)
tgsas.d (𝜑 → 𝐷 ∈ 𝑃)
tgsas.e (𝜑 → 𝐸 ∈ 𝑃)
tgsas.f (𝜑 → 𝐹 ∈ 𝑃)
tgasa.l 𝐿 = (LineG‘𝐺)
tgasa.1 (𝜑 → ¬ (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))
tgasa.2 (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))
tgasa.3 (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
tgasa.4 (𝜑 → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩)
Assertion
Ref Expression
tgasa1 (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹))

Proof of Theorem tgasa1
Dummy variables 𝑎 𝑏 𝑓 𝑤 𝑡 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprr 785 . . 3 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐸 − 𝑓) = (𝐵 − 𝐶))
2 tgsas.p . . . . 5 𝑃 = (Base‘𝐺)
3 tgsas.i . . . . 5 𝐼 = (Itv‘𝐺)
4 tgasa.l . . . . 5 𝐿 = (LineG‘𝐺)
5 tgsas.g . . . . . 6 (𝜑 → 𝐺 ∈ TarskiG)
65ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐺 ∈ TarskiG)
7 tgsas.f . . . . . 6 (𝜑 → 𝐹 ∈ 𝑃)
87ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹 ∈ 𝑃)
9 tgsas.d . . . . . 6 (𝜑 → 𝐷 ∈ 𝑃)
109ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐷 ∈ 𝑃)
11 tgsas.e . . . . . 6 (𝜑 → 𝐸 ∈ 𝑃)
1211ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐸 ∈ 𝑃)
13 tgsas.m . . . . . . 7 − = (dist‘𝐺)
14 tgsas.a . . . . . . 7 (𝜑 → 𝐴 ∈ 𝑃)
15 tgsas.b . . . . . . 7 (𝜑 → 𝐵 ∈ 𝑃)
16 tgsas.c . . . . . . 7 (𝜑 → 𝐶 ∈ 𝑃)
17 tgasa.3 . . . . . . 7 (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
18 tgasa.1 . . . . . . 7 (𝜑 → ¬ (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))
192, 3, 13, 5, 14, 15, 16, 9, 11, 7, 17, 4, 18cgrancol 29394 . . . . . 6 (𝜑 → ¬ (𝐹 ∈ (𝐷𝐿𝐸) ∨ 𝐷 = 𝐸))
2019ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ¬ (𝐹 ∈ (𝐷𝐿𝐸) ∨ 𝐷 = 𝐸))
21 eqid 2763 . . . . . 6 (hlG‘𝐺) = (hlG‘𝐺)
22 simplr 781 . . . . . 6 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 ∈ 𝑃)
2316ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐶 ∈ 𝑃)
2414ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐴 ∈ 𝑃)
2515ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐵 ∈ 𝑃)
2618ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ¬ (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))
275ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐺 ∈ TarskiG)
289ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐷 ∈ 𝑃)
2911ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐸 ∈ 𝑃)
307ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐹 ∈ 𝑃)
3114ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐴 ∈ 𝑃)
3215ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐵 ∈ 𝑃)
3316ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → 𝐶 ∈ 𝑃)
342, 3, 5, 21, 14, 15, 16, 9, 11, 7, 17cgracom 29386 . . . . . . . . . 10 (𝜑 → ⟨“𝐷𝐸𝐹”⟩(cgrA‘𝐺)⟨“𝐴𝐵𝐶”⟩)
3534ad3antrrr 743 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → ⟨“𝐷𝐸𝐹”⟩(cgrA‘𝐺)⟨“𝐴𝐵𝐶”⟩)
36 simpr 490 . . . . . . . . . . 11 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹))
372, 4, 3, 27, 28, 30, 29, 36colcom 29078 . . . . . . . . . 10 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → (𝐸 ∈ (𝐹𝐿𝐷) ∨ 𝐹 = 𝐷))
382, 4, 3, 27, 30, 28, 29, 37colrot1 29079 . . . . . . . . 9 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → (𝐹 ∈ (𝐷𝐿𝐸) ∨ 𝐷 = 𝐸))
392, 3, 13, 27, 28, 29, 30, 31, 32, 33, 35, 4, 38cgracol 29393 . . . . . . . 8 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))
4018ad3antrrr 743 . . . . . . . 8 ((((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) ∧ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹)) → ¬ (𝐶 ∈ (𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))
4139, 40pm2.65da 829 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ¬ (𝐸 ∈ (𝐷𝐿𝐹) ∨ 𝐷 = 𝐹))
42 eqid 2763 . . . . . . . . . 10 (cgrG‘𝐺) = (cgrG‘𝐺)
4317ad2antrr 739 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
44 simprl 783 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓((hlG‘𝐺)‘𝐸)𝐹)
452, 3, 21, 6, 24, 25, 23, 10, 12, 8, 43, 22, 44cgrahl2 29381 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝑓”⟩)
462, 3, 21, 5, 14, 15, 16, 9, 11, 7, 17cgrane1 29376 . . . . . . . . . . . . . 14 (𝜑 → 𝐴 ≠ 𝐵)
472, 3, 21, 14, 14, 15, 5, 46hlid 29132 . . . . . . . . . . . . 13 (𝜑 → 𝐴((hlG‘𝐺)‘𝐵)𝐴)
4847ad2antrr 739 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐴((hlG‘𝐺)‘𝐵)𝐴)
492, 3, 21, 5, 14, 15, 16, 9, 11, 7, 17cgrane2 29377 . . . . . . . . . . . . . . 15 (𝜑 → 𝐵 ≠ 𝐶)
5049necomd 3014 . . . . . . . . . . . . . 14 (𝜑 → 𝐶 ≠ 𝐵)
512, 3, 21, 16, 14, 15, 5, 50hlid 29132 . . . . . . . . . . . . 13 (𝜑 → 𝐶((hlG‘𝐺)‘𝐵)𝐶)
5251ad2antrr 739 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐶((hlG‘𝐺)‘𝐵)𝐶)
53 tgasa.2 . . . . . . . . . . . . . 14 (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))
542, 13, 3, 5, 14, 15, 9, 11, 53tgcgrcomlr 28999 . . . . . . . . . . . . 13 (𝜑 → (𝐵 − 𝐴) = (𝐸 − 𝐷))
5554ad2antrr 739 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐵 − 𝐴) = (𝐸 − 𝐷))
561eqcomd 2769 . . . . . . . . . . . 12 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐵 − 𝐶) = (𝐸 − 𝑓))
572, 3, 21, 6, 24, 25, 23, 10, 12, 22, 45, 24, 13, 23, 48, 52, 55, 56cgracgr 29382 . . . . . . . . . . 11 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐴 − 𝐶) = (𝐷 − 𝑓))
582, 13, 3, 6, 24, 23, 10, 22, 57tgcgrcomlr 28999 . . . . . . . . . 10 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐶 − 𝐴) = (𝑓 − 𝐷))
5953ad2antrr 739 . . . . . . . . . 10 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐴 − 𝐵) = (𝐷 − 𝐸))
602, 13, 42, 6, 23, 24, 25, 22, 10, 12, 58, 59, 56trgcgr 29036 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐶𝐴𝐵”⟩(cgrG‘𝐺)⟨“𝑓𝐷𝐸”⟩)
612, 3, 4, 5, 16, 14, 15, 18ncolne1 29150 . . . . . . . . . . . 12 (𝜑 → 𝐶 ≠ 𝐴)
6261ad2antrr 739 . . . . . . . . . . 11 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐶 ≠ 𝐴)
632, 13, 3, 6, 23, 24, 22, 10, 58, 62tgcgrneq 29002 . . . . . . . . . 10 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 ≠ 𝐷)
642, 3, 21, 22, 8, 10, 6, 63hlid 29132 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓((hlG‘𝐺)‘𝐷)𝑓)
65 tgasa.4 . . . . . . . . . . . . 13 (𝜑 → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐹𝐷𝐸”⟩)
662, 3, 21, 5, 16, 14, 15, 7, 9, 11, 65cgrane4 29379 . . . . . . . . . . . 12 (𝜑 → 𝐷 ≠ 𝐸)
6766necomd 3014 . . . . . . . . . . 11 (𝜑 → 𝐸 ≠ 𝐷)
682, 3, 21, 11, 14, 9, 5, 67hlid 29132 . . . . . . . . . 10 (𝜑 → 𝐸((hlG‘𝐺)‘𝐷)𝐸)
6968ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐸((hlG‘𝐺)‘𝐷)𝐸)
702, 3, 21, 6, 23, 24, 25, 22, 10, 12, 22, 12, 60, 64, 69iscgrad 29375 . . . . . . . 8 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝑓𝐷𝐸”⟩)
7166ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐷 ≠ 𝐸)
722, 3, 6, 21, 22, 10, 12, 63, 71cgraswap 29384 . . . . . . . 8 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝑓𝐷𝐸”⟩(cgrA‘𝐺)⟨“𝐸𝐷𝑓”⟩)
732, 3, 6, 21, 23, 24, 25, 22, 10, 12, 70, 12, 10, 22, 72cgratr 29387 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐸𝐷𝑓”⟩)
742, 3, 21, 5, 16, 14, 15, 7, 9, 11, 65cgrane3 29378 . . . . . . . . . . 11 (𝜑 → 𝐷 ≠ 𝐹)
7574necomd 3014 . . . . . . . . . 10 (𝜑 → 𝐹 ≠ 𝐷)
762, 3, 5, 21, 7, 9, 11, 75, 66cgraswap 29384 . . . . . . . . 9 (𝜑 → ⟨“𝐹𝐷𝐸”⟩(cgrA‘𝐺)⟨“𝐸𝐷𝐹”⟩)
772, 3, 5, 21, 16, 14, 15, 7, 9, 11, 65, 11, 9, 7, 76cgratr 29387 . . . . . . . 8 (𝜑 → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐸𝐷𝐹”⟩)
7877ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ⟨“𝐶𝐴𝐵”⟩(cgrA‘𝐺)⟨“𝐸𝐷𝐹”⟩)
792, 3, 4, 5, 11, 9, 67tgelrnln 29155 . . . . . . . . 9 (𝜑 → (𝐸𝐿𝐷) ∈ ran 𝐿)
8079ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐸𝐿𝐷) ∈ ran 𝐿)
81 simpl 488 . . . . . . . . . . . 12 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → 𝑎 = 𝑢)
8281eleq1d 2849 . . . . . . . . . . 11 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → (𝑎 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ↔ 𝑢 ∈ (𝑃 ∖ (𝐸𝐿𝐷))))
83 simpr 490 . . . . . . . . . . . 12 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → 𝑏 = 𝑣)
8483eleq1d 2849 . . . . . . . . . . 11 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → (𝑏 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ↔ 𝑣 ∈ (𝑃 ∖ (𝐸𝐿𝐷))))
8582, 84anbi12d 644 . . . . . . . . . 10 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → ((𝑎 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐸𝐿𝐷))) ↔ (𝑢 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑣 ∈ (𝑃 ∖ (𝐸𝐿𝐷)))))
86 simpr 490 . . . . . . . . . . . 12 (((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) ∧ 𝑡 = 𝑤) → 𝑡 = 𝑤)
87 simpll 779 . . . . . . . . . . . . 13 (((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) ∧ 𝑡 = 𝑤) → 𝑎 = 𝑢)
88 simplr 781 . . . . . . . . . . . . 13 (((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) ∧ 𝑡 = 𝑤) → 𝑏 = 𝑣)
8987, 88oveq12d 7469 . . . . . . . . . . . 12 (((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) ∧ 𝑡 = 𝑤) → (𝑎𝐼𝑏) = (𝑢𝐼𝑣))
9086, 89eleq12d 2858 . . . . . . . . . . 11 (((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) ∧ 𝑡 = 𝑤) → (𝑡 ∈ (𝑎𝐼𝑏) ↔ 𝑤 ∈ (𝑢𝐼𝑣)))
9190cbvrexdva 3247 . . . . . . . . . 10 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → (∃𝑡 ∈ (𝐸𝐿𝐷)𝑡 ∈ (𝑎𝐼𝑏) ↔ ∃𝑤 ∈ (𝐸𝐿𝐷)𝑤 ∈ (𝑢𝐼𝑣)))
9285, 91anbi12d 644 . . . . . . . . 9 ((𝑎 = 𝑢 ∧ 𝑏 = 𝑣) → (((𝑎 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐸𝐿𝐷))) ∧ ∃𝑡 ∈ (𝐸𝐿𝐷)𝑡 ∈ (𝑎𝐼𝑏)) ↔ ((𝑢 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑣 ∈ (𝑃 ∖ (𝐸𝐿𝐷))) ∧ ∃𝑤 ∈ (𝐸𝐿𝐷)𝑤 ∈ (𝑢𝐼𝑣))))
9392cbvopabv 5184 . . . . . . . 8 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐸𝐿𝐷))) ∧ ∃𝑡 ∈ (𝐸𝐿𝐷)𝑡 ∈ (𝑎𝐼𝑏))} = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝑃 ∖ (𝐸𝐿𝐷)) ∧ 𝑣 ∈ (𝑃 ∖ (𝐸𝐿𝐷))) ∧ ∃𝑤 ∈ (𝐸𝐿𝐷)𝑤 ∈ (𝑢𝐼𝑣))}
942, 3, 4, 5, 11, 9, 67tglinerflx1 29158 . . . . . . . . . 10 (𝜑 → 𝐸 ∈ (𝐸𝐿𝐷))
9594ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐸 ∈ (𝐸𝐿𝐷))
962, 4, 3, 5, 9, 11, 7, 19ncolcom 29081 . . . . . . . . . . 11 (𝜑 → ¬ (𝐹 ∈ (𝐸𝐿𝐷) ∨ 𝐸 = 𝐷))
97 pm2.45 895 . . . . . . . . . . 11 (¬ (𝐹 ∈ (𝐸𝐿𝐷) ∨ 𝐸 = 𝐷) → ¬ 𝐹 ∈ (𝐸𝐿𝐷))
9896, 97syl 18 . . . . . . . . . 10 (𝜑 → ¬ 𝐹 ∈ (𝐸𝐿𝐷))
9998ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → ¬ 𝐹 ∈ (𝐸𝐿𝐷))
1002, 3, 21, 22, 8, 12, 6, 44hlcomd 29127 . . . . . . . . 9 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹((hlG‘𝐺)‘𝐸)𝑓)
1012, 3, 4, 6, 80, 12, 93, 21, 95, 8, 22, 99, 100hphl 29306 . . . . . . . 8 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹((hpG‘𝐺)‘(𝐸𝐿𝐷))𝑓)
1022, 3, 4, 6, 80, 8, 93, 22, 101hpgcom 29302 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓((hpG‘𝐺)‘(𝐸𝐿𝐷))𝐹)
1032, 3, 4, 5, 79, 7, 93, 98hpgid 29301 . . . . . . . 8 (𝜑 → 𝐹((hpG‘𝐺)‘(𝐸𝐿𝐷))𝐹)
104103ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹((hpG‘𝐺)‘(𝐸𝐿𝐷))𝐹)
1052, 3, 13, 6, 23, 24, 25, 12, 10, 8, 4, 26, 41, 22, 8, 21, 73, 78, 102, 104acopyeu 29399 . . . . . 6 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓((hlG‘𝐺)‘𝐷)𝐹)
1062, 3, 21, 22, 8, 10, 6, 4, 105hlln 29130 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 ∈ (𝐹𝐿𝐷))
1072, 3, 4, 5, 7, 9, 75tglinerflx1 29158 . . . . . 6 (𝜑 → 𝐹 ∈ (𝐹𝐿𝐷))
108107ad2antrr 739 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹 ∈ (𝐹𝐿𝐷))
1092, 3, 21, 5, 14, 15, 16, 9, 11, 7, 17cgrane4 29379 . . . . . . 7 (𝜑 → 𝐸 ≠ 𝐹)
110109ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐸 ≠ 𝐹)
1112, 3, 21, 22, 8, 12, 6, 4, 44hlln 29130 . . . . . 6 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 ∈ (𝐹𝐿𝐸))
1122, 3, 4, 6, 12, 8, 22, 110, 111lncom 29147 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 ∈ (𝐸𝐿𝐹))
1132, 3, 4, 6, 12, 8, 110tglinerflx2 29159 . . . . 5 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝐹 ∈ (𝐸𝐿𝐹))
1142, 3, 4, 6, 8, 10, 12, 8, 20, 106, 108, 112, 113tglineinteq 29171 . . . 4 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → 𝑓 = 𝐹)
115114oveq2d 7467 . . 3 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐸 − 𝑓) = (𝐸 − 𝐹))
1161, 115eqtr3d 2800 . 2 (((𝜑 ∧ 𝑓 ∈ 𝑃) ∧ (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶))) → (𝐵 − 𝐶) = (𝐸 − 𝐹))
117109necomd 3014 . . 3 (𝜑 → 𝐹 ≠ 𝐸)
1182, 3, 21, 11, 15, 16, 5, 7, 13, 117, 49hlcgrex 29139 . 2 (𝜑 → ∃𝑓 ∈ 𝑃 (𝑓((hlG‘𝐺)‘𝐸)𝐹 ∧ (𝐸 − 𝑓) = (𝐵 − 𝐶)))
119116, 118r19.29a 3174 1 (𝜑 → (𝐵 − 𝐶) = (𝐸 − 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   ∖ cdif 4048   class class class wbr 5108  {copab 5173  ran crn 5659  ‘cfv 6566  (class class class)co 7451  ⟨“cs3 15035  Basecbs 17431  distcds 17481  TarskiGcstrkg 28946  Itvcitv 28952  LineGclng 28953  cgrGccgrg 29030  hlGchlg 29120  hpGchpg 29292  cgrAccgra 29371
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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
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-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-tp 4593  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-er 8755  df-map 8887  df-pm 8888  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-n0 12647  df-xnn0 12720  df-z 12734  df-uz 13006  df-fz 13680  df-fzo 13829  df-hash 14516  df-word 14700  df-concat 14757  df-s1 14784  df-s2 15041  df-s3 15042  df-trkgc 28967  df-trkgb 28968  df-trkgcb 28969  df-trkgld 28971  df-trkg 28972  df-cgrg 29031  df-leg 29103  df-hlg 29121  df-mir 29182  df-rag 29226  df-perpg 29228  df-hpg 29293  df-mid 29336  df-lmi 29337  df-cgra 29372
This theorem is used by:  tgasa  29461
  Copyright terms: Public domain W3C validator