Theorem iscgrag 33082

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 29346 (Schwabhauser 11.3) repackaged -- nothing is constructed; the distances are read off the cgrG with cgr3simp1 29013 and cgr3simp2 29014. No non-degeneracy hypothesis is needed or wanted: cgrA carries vertex distinctness intrinsically (cgrane1 29349 through cgrane4 29352), 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 2763	. . . . . . . . . 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 29013	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐴 − 𝐵) = (𝑥 − 𝐸))
22	2, 3, 4, 8, 10, 12, 13, 15, 21	tgcgrcomlr 28972	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐵 − 𝐴) = (𝐸 − 𝑥))
23	22	eqcomd 2769	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐸 − 𝑥) = (𝐵 − 𝐴))
24	2, 3, 4, 16, 8, 10, 12, 18, 13, 15, 19, 20	cgr3simp2 29014	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ 𝑦 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)) → (𝐵 − 𝐶) = (𝐸 − 𝑦))
25	24	eqcomd 2769	. . . . . . 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 3179	. . 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 29346	. . 3 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹)))
36	31, 35	mpbid 235	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹))
37	30, 36	reximddv3 3183	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 ∃𝑦 ∈ 𝑃 ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑥𝐸𝑦”⟩ ∧ 𝑥(𝐾‘𝐸)𝐷 ∧ 𝑦(𝐾‘𝐸)𝐹) ∧ ((𝐸 − 𝑥) = (𝐵 − 𝐴) ∧ (𝐸 − 𝑦) = (𝐵 − 𝐶))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  ⟨“cs3 15021  Basecbs 17416  distcds 17466  TarskiGcstrkg 28919  Itvcitv 28925  cgrGccgrg 29003  hlGchlg 29093  cgrAccgra 29344

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304

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-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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-er 8745  df-map 8877  df-pm 8878  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-card 10047  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-2 12432  df-3 12433  df-n0 12634  df-z 12721  df-uz 12993  df-fz 13667  df-fzo 13816  df-hash 14502  df-word 14686  df-concat 14743  df-s1 14770  df-s2 15027  df-s3 15028  df-trkgc 28940  df-trkgcb 28942  df-trkg 28945  df-cgrg 29004  df-cgra 29345

This theorem is used by:  inagcgratrgncol  33087