Theorem iscgrag 33052

Description: Ray normalization: an angle congruence yields two points on the target rays carrying a full triangle congruence, together with the two arm lengths. This is the forward direction of iscgra 29316 (Schwabhauser 11.3) repackaged -- nothing is constructed; the distances are read off the cgrG with cgr3simp1 28983 and cgr3simp2 28984. No non-degeneracy hypothesis is needed or wanted: cgrA carries vertex distinctness intrinsically (cgrane1 29319 through cgrane4 29322), and an extra hypothesis would obstruct the degenerate branches. (Contributed by JAG, 12-Aug-2026.)

Hypotheses

Ref	Expression
iscgrag.p	⊢ 𝑃 = (Base‘𝐺)
iscgrag.i	⊢ 𝐼 = (Itv‘𝐺)
iscgrag.k	⊢ 𝐾 = (hlG‘𝐺)
iscgrag.m	⊢ − = (dist‘𝐺)
iscgrag.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
iscgrag.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
iscgrag.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
iscgrag.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
iscgrag.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
iscgrag.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
iscgrag.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
iscgrag.1	⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)

Assertion

Ref	Expression
iscgrag	⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))

Distinct variable groups:   𝜑,𝑥   𝑥,𝑃   𝑥,𝐼   𝑥,𝐾   𝑥,𝐺   𝑥, −   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷   𝑥,𝐸   𝑥,𝐹   𝜑,𝑦   𝑦,𝑃   𝑦,𝐼   𝑦,𝐾   𝑦,𝐺   𝑦, −   𝑦,𝐴   𝑦,𝐵   𝑦,𝐶   𝑦,𝐷   𝑦,𝐸   𝑦,𝐹,𝑥

Proof of Theorem iscgrag

Step	Hyp	Ref	Expression
1		simpr 490	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))
2		iscgrag.p	. . . . . . . . 9 ⊢ 𝑃 = (Base‘𝐺)
3		iscgrag.m	. . . . . . . . 9 ⊢ − = (dist‘𝐺)
4		iscgrag.i	. . . . . . . . 9 ⊢ 𝐼 = (Itv‘𝐺)
5		simpll 779	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝜑 ∧ 𝑥 ∈ 𝑃))
6	5	simpld 500	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝜑)
7		iscgrag.g	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
8	6, 7	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐺 ∈ TarskiG)
9		iscgrag.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
10	6, 9	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐴 ∈ 𝑃)
11		iscgrag.b	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
12	6, 11	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐵 ∈ 𝑃)
13	5	simprd 501	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑥 ∈ 𝑃)
14		iscgrag.e	. . . . . . . . . 10 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
15	6, 14	syl 18	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐸 ∈ 𝑃)
16		eqid 2760	. . . . . . . . . 10 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
17		iscgrag.c	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
18	6, 17	syl 18	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝐶 ∈ 𝑃)
19		simplr 781	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → 𝑦 ∈ 𝑃)
20	1	simp1d 1160	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩)
21	2, 3, 4, 16, 8, 10, 12, 18, 13, 15, 19, 20	cgr3simp1 28983	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐴 − 𝐵) = (𝑥 − 𝐸))
22	2, 3, 4, 8, 10, 12, 13, 15, 21	tgcgrcomlr 28942	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐵 − 𝐴) = (𝐸 − 𝑥))
23	22	eqcomd 2766	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐸 − 𝑥) = (𝐵 − 𝐴))
24	2, 3, 4, 16, 8, 10, 12, 18, 13, 15, 19, 20	cgr3simp2 28984	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐵 − 𝐶) = (𝐸 − 𝑦))
25	24	eqcomd 2766	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐸 − 𝑦) = (𝐵 − 𝐶))
26	23, 25	jca 521	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))
27	1, 26	jca 521	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
28	27	ex 418	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))))
29	28	reximdva 3175	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → (∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) → ∃𝑦 ∈ 𝑃 ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶)))))
30	29	imp 412	. 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → ∃𝑦 ∈ 𝑃 ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))
31		iscgrag.1	. . 3 ⊢ (𝜑 → ⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩)
32		iscgrag.k	. . . 4 ⊢ 𝐾 = (hlG‘𝐺)
33		iscgrag.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
34		iscgrag.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
35	2, 4, 32, 7, 9, 11, 17, 33, 14, 34	iscgra 29316	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)))
36	31, 35	mpbid 235	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))
37	30, 36	reximddv3 3179	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃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  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-er 8717  df-map 8849  df-pm 8850  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  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-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-trkgcb 28912  df-trkg 28915  df-cgrg 28974  df-cgra 29315

This theorem is used by:  inagcgratrgncol  33057