Users' Mathboxes Mathbox for Jorge Agra < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cgrahlb Structured version   Visualization version   GIF version

Theorem cgrahlb 33047
Description: Two null angles are congruent: if 𝐴 and 𝐶 lie on one half-line from 𝐵, and 𝐷 and 𝐹 on one half-line from 𝐸, then angle ⟨“𝐴𝐵𝐶”⟩ is congruent to ⟨“𝐷𝐸𝐹”⟩. This is GeoCoq l11_21_b ; set.mm has only the converse, cgrahl 29335 (GeoCoq l11_21_a ). Proved by copying both arms onto the target rays with hlcgrex 29082 and closing the third side by segment subtraction (tgcgrsub2 29058), so it needs no non-collinear frame. (Contributed by JAG, 12-Aug-2026.)
Hypotheses
Ref Expression
cgrahlb.p 𝑃 = (Base‘𝐺)
cgrahlb.i 𝐼 = (Itv‘𝐺)
cgrahlb.k 𝐾 = (hlG‘𝐺)
cgrahlb.m − = (dist‘𝐺)
cgrahlb.g (𝜑 → 𝐺 ∈ TarskiG)
cgrahlb.a (𝜑 → 𝐴 ∈ 𝑃)
cgrahlb.b (𝜑 → 𝐵 ∈ 𝑃)
cgrahlb.c (𝜑 → 𝐶 ∈ 𝑃)
cgrahlb.d (𝜑 → 𝐷 ∈ 𝑃)
cgrahlb.e (𝜑 → 𝐸 ∈ 𝑃)
cgrahlb.f (𝜑 → 𝐹 ∈ 𝑃)
cgrahlb.1 (𝜑 → 𝐴(𝐾‘𝐵)𝐶)
cgrahlb.2 (𝜑 → 𝐷(𝐾‘𝐸)𝐹)
Assertion
Ref Expression
cgrahlb (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)

Proof of Theorem cgrahlb
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cgrahlb.p . . 3 𝑃 = (Base‘𝐺)
2 cgrahlb.i . . 3 𝐼 = (Itv‘𝐺)
3 cgrahlb.k . . 3 𝐾 = (hlG‘𝐺)
4 simplll 787 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝜑)
5 cgrahlb.g . . . 4 (𝜑 → 𝐺 ∈ TarskiG)
64, 5syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐺 ∈ TarskiG)
7 cgrahlb.a . . . 4 (𝜑 → 𝐴 ∈ 𝑃)
84, 7syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐴 ∈ 𝑃)
9 cgrahlb.b . . . 4 (𝜑 → 𝐵 ∈ 𝑃)
104, 9syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐵 ∈ 𝑃)
11 cgrahlb.c . . . 4 (𝜑 → 𝐶 ∈ 𝑃)
124, 11syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐶 ∈ 𝑃)
13 cgrahlb.d . . . 4 (𝜑 → 𝐷 ∈ 𝑃)
144, 13syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐷 ∈ 𝑃)
15 cgrahlb.e . . . 4 (𝜑 → 𝐸 ∈ 𝑃)
164, 15syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐸 ∈ 𝑃)
17 cgrahlb.f . . . 4 (𝜑 → 𝐹 ∈ 𝑃)
184, 17syl 18 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐹 ∈ 𝑃)
19 simpllr 788 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑥 ∈ 𝑃)
20 simplr 781 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑦 ∈ 𝑃)
21 cgrahlb.m . . . 4 − = (dist‘𝐺)
22 eqid 2760 . . . 4 (cgrG‘𝐺) = (cgrG‘𝐺)
23 simpr 490 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
2423simpld 500 . . . . . . 7 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)))
2524simprd 501 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐸 − 𝑥) = (𝐵 − 𝐴))
2625eqcomd 2766 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐵 − 𝐴) = (𝐸 − 𝑥))
271, 21, 2, 6, 10, 8, 16, 19, 26tgcgrcomlr 28942 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐴 − 𝐵) = (𝑥 − 𝐸))
2823simprd 501 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))
2928simprd 501 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐸 − 𝑦) = (𝐵 − 𝐶))
3029eqcomd 2766 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐵 − 𝐶) = (𝐸 − 𝑦))
31 eqid 2760 . . . . . 6 (≤G‘𝐺) = (≤G‘𝐺)
32 cgrahlb.1 . . . . . . . . 9 (𝜑 → 𝐴(𝐾‘𝐵)𝐶)
334, 32syl 18 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐴(𝐾‘𝐵)𝐶)
341, 2, 3, 8, 12, 10, 6ishlg 29068 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐴(𝐾‘𝐵)𝐶 ↔ (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝐴)))))
3533, 34mpbid 235 . . . . . . 7 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐴 ≠ 𝐵 ∧ 𝐶 ≠ 𝐵 ∧ (𝐴 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝐴))))
3635simp3d 1162 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐴 ∈ (𝐵𝐼𝐶) ∨ 𝐶 ∈ (𝐵𝐼𝐴)))
3724simpld 500 . . . . . . . . . 10 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑥(𝐾‘𝐸)𝐷)
38 cgrahlb.2 . . . . . . . . . . 11 (𝜑 → 𝐷(𝐾‘𝐸)𝐹)
394, 38syl 18 . . . . . . . . . 10 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐷(𝐾‘𝐸)𝐹)
401, 2, 3, 19, 14, 18, 6, 16, 37, 39hltr 29076 . . . . . . . . 9 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑥(𝐾‘𝐸)𝐹)
4128simpld 500 . . . . . . . . . 10 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑦(𝐾‘𝐸)𝐹)
421, 2, 3, 20, 18, 16, 6, 41hlcomd 29070 . . . . . . . . 9 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝐹(𝐾‘𝐸)𝑦)
431, 2, 3, 19, 18, 20, 6, 16, 40, 42hltr 29076 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → 𝑥(𝐾‘𝐸)𝑦)
441, 2, 3, 19, 20, 16, 6ishlg 29068 . . . . . . . 8 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝑥(𝐾‘𝐸)𝑦 ↔ (𝑥 ≠ 𝐸 ∧ 𝑦 ≠ 𝐸 ∧ (𝑥 ∈ (𝐸𝐼𝑦) ∨ 𝑦 ∈ (𝐸𝐼𝑥)))))
4543, 44mpbid 235 . . . . . . 7 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝑥 ≠ 𝐸 ∧ 𝑦 ≠ 𝐸 ∧ (𝑥 ∈ (𝐸𝐼𝑦) ∨ 𝑦 ∈ (𝐸𝐼𝑥))))
4645simp3d 1162 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝑥 ∈ (𝐸𝐼𝑦) ∨ 𝑦 ∈ (𝐸𝐼𝑥)))
471, 21, 2, 31, 6, 10, 8, 12, 16, 16, 19, 20, 36, 46, 26, 30tgcgrsub2 29058 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐴 − 𝐶) = (𝑥 − 𝑦))
481, 21, 2, 6, 8, 12, 19, 20, 47tgcgrcomlr 28942 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → (𝐶 − 𝐴) = (𝑦 − 𝑥))
491, 21, 22, 6, 8, 10, 12, 19, 16, 20, 27, 30, 48trgcgr 28979 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩)
501, 2, 3, 6, 8, 10, 12, 14, 16, 18, 19, 20, 49, 37, 41iscgrad 29318 . 2 ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))) → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
511, 2, 3, 13, 17, 15, 5, 38hlne1 29071 . . . . 5 (𝜑 → 𝐷 ≠ 𝐸)
521, 2, 3, 7, 11, 9, 5, 32hlne1 29071 . . . . . 6 (𝜑 → 𝐴 ≠ 𝐵)
5352necomd 3010 . . . . 5 (𝜑 → 𝐵 ≠ 𝐴)
541, 2, 3, 15, 9, 7, 5, 13, 21, 51, 53hlcgrex 29082 . . . 4 (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)))
551, 2, 3, 13, 17, 15, 5, 38hlne2 29072 . . . . 5 (𝜑 → 𝐹 ≠ 𝐸)
561, 2, 3, 7, 11, 9, 5, 32hlne2 29072 . . . . . 6 (𝜑 → 𝐶 ≠ 𝐵)
5756necomd 3010 . . . . 5 (𝜑 → 𝐵 ≠ 𝐶)
581, 2, 3, 15, 9, 11, 5, 17, 21, 55, 57hlcgrex 29082 . . . 4 (𝜑 → ∃𝑦 ∈ 𝑃 (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))
5954, 58jca 521 . . 3 (𝜑 → (∃𝑥 ∈ 𝑃 (𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ ∃𝑦 ∈ 𝑃 (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
60 reeanv 3234 . . 3 (∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))) ↔ (∃𝑥 ∈ 𝑃 (𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ ∃𝑦 ∈ 𝑃 (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
6159, 60sylibr 237 . 2 (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 ((𝑥(𝐾‘𝐸)𝐷 ∧ (𝐸 − 𝑥) = (𝐵 − 𝐴)) ∧ (𝑦(𝐾‘𝐸)𝐹 ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
6250, 61r19.29vva 3222 1 (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  ⟨“cs3 14993  Basecbs 17387  distcds 17437  TarskiGcstrkg 28889  Itvcitv 28895  cgrGccgrg 28973  ≤Gcleg 29045  hlGchlg 29063  cgrAccgra 29314
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-oadd 8480  df-er 8717  df-map 8849  df-pm 8850  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-dju 9982  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-3 12406  df-n0 12607  df-xnn0 12680  df-z 12694  df-uz 12966  df-fz 13640  df-fzo 13789  df-hash 14475  df-word 14659  df-concat 14716  df-s1 14743  df-s2 14999  df-s3 15000  df-trkgc 28910  df-trkgb 28911  df-trkgcb 28912  df-trkg 28915  df-cgrg 28974  df-leg 29046  df-hlg 29064  df-cgra 29315
This theorem is used by:  inagcgrasubhl  33049
  Copyright terms: Public domain W3C validator