iscgra1 - Metamath Proof Explorer

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

Theorem iscgra1 28050

Description: A special version of iscgra 28049 where one distance is known to be equal. In this case, angle congruence can be written with only one quantifier. (Contributed by Thierry Arnoux, 9-Aug-2020.)

**Hypotheses**
Ref	Expression
iscgra.p	⊢ 𝑃 = (Base‘𝐺)
iscgra.i	⊢ 𝐼 = (Itv‘𝐺)
iscgra.k	⊢ 𝐾 = (hlG‘𝐺)
iscgra.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
iscgra.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
iscgra.b	⊢ (𝜑 → 𝐵 ∈ 𝑃)
iscgra.c	⊢ (𝜑 → 𝐶 ∈ 𝑃)
iscgra.d	⊢ (𝜑 → 𝐷 ∈ 𝑃)
iscgra.e	⊢ (𝜑 → 𝐸 ∈ 𝑃)
iscgra.f	⊢ (𝜑 → 𝐹 ∈ 𝑃)
iscgra1.m	⊢ − = (dist‘𝐺)
iscgra1.1	⊢ (𝜑 → 𝐴 ≠ 𝐵)
iscgra1.2	⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))

**Assertion**
Ref	Expression
iscgra1	⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐶 𝑥,𝐷 𝑥,𝐸 𝑥,𝐹 𝑥,𝐾 𝜑,𝑥 𝑥,𝐺 𝑥,𝐼 𝑥,𝑃 Allowed substitution hint: − (𝑥)

Proof of Theorem iscgra1 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iscgra.p	. . 3 ⊢ 𝑃 = (Base‘𝐺)
2		iscgra.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
3		iscgra.k	. . 3 ⊢ 𝐾 = (hlG‘𝐺)
4		iscgra.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5		iscgra.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
6		iscgra.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
7		iscgra.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
8		iscgra.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑃)
9		iscgra.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑃)
10		iscgra.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑃)
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	iscgra 28049	. 2 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑦 ∈ 𝑃 ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)))
12	9	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐸 ∈ 𝑃)
13	6	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐵 ∈ 𝑃)
14	5	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐴 ∈ 𝑃)
15	4	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐺 ∈ TarskiG)
16	8	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐷 ∈ 𝑃)
17		iscgra1.m	. . . . . . . 8 ⊢ − = (dist‘𝐺)
18		simpllr 774	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝑦 ∈ 𝑃)
19		simpr2 1195	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝑦(𝐾‘𝐸)𝐷)
20	1, 2, 3, 18, 16, 12, 15, 19	hlne2 27846	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐷 ≠ 𝐸)
21		iscgra1.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≠ 𝐵)
22	21	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐴 ≠ 𝐵)
23	22	necomd 2996	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐵 ≠ 𝐴)
24	1, 2, 3, 16, 12, 12, 15, 20	hlid 27849	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐷(𝐾‘𝐸)𝐷)
25		eqid 2732	. . . . . . . . . . 11 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺)
26	7	ad3antrrr 728	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝐶 ∈ 𝑃)
27		simplr 767	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝑥 ∈ 𝑃)
28		simpr1 1194	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
29	1, 17, 2, 25, 15, 14, 13, 26, 18, 12, 27, 28	cgr3simp1 27760	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝐴 − 𝐵) = (𝑦 − 𝐸))
30	29	eqcomd 2738	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝑦 − 𝐸) = (𝐴 − 𝐵))
31	1, 17, 2, 15, 18, 12, 14, 13, 30	tgcgrcomlr 27720	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝐸 − 𝑦) = (𝐵 − 𝐴))
32		iscgra1.2	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐷 − 𝐸))
33	32	ad3antrrr 728	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝐴 − 𝐵) = (𝐷 − 𝐸))
34	33	eqcomd 2738	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝐷 − 𝐸) = (𝐴 − 𝐵))
35	1, 17, 2, 15, 16, 12, 14, 13, 34	tgcgrcomlr 27720	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝐸 − 𝐷) = (𝐵 − 𝐴))
36	1, 2, 3, 12, 13, 14, 15, 16, 17, 20, 23, 18, 16, 19, 24, 31, 35	hlcgreulem 27857	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝑦 = 𝐷)
37		simpr3 1196	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → 𝑥(𝐾‘𝐸)𝐹)
38	36, 28, 37	jca32 516	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹)) → (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
39		simprrl 779	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
40		simprl 769	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝑦 = 𝐷)
41	8	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝐷 ∈ 𝑃)
42	9	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝐸 ∈ 𝑃)
43	4	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝐺 ∈ TarskiG)
44	1, 17, 2, 4, 5, 6, 8, 9, 32, 21	tgcgrneq 27723	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ≠ 𝐸)
45	44	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝐷 ≠ 𝐸)
46	1, 2, 3, 41, 41, 42, 43, 45	hlid 27849	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝐷(𝐾‘𝐸)𝐷)
47	40, 46	eqbrtrd 5169	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝑦(𝐾‘𝐸)𝐷)
48		simprrr 780	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → 𝑥(𝐾‘𝐸)𝐹)
49	39, 47, 48	3jca 1128	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹))
50	38, 49	impbida 799	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝑃) ∧ 𝑥 ∈ 𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))))
51	50	rexbidva 3176	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → (∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ ∃𝑥 ∈ 𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))))
52		r19.42v 3190	. . . 4 ⊢ (∃𝑥 ∈ 𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)) ↔ (𝑦 = 𝐷 ∧ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
53	51, 52	bitrdi 286	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → (∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))))
54	53	rexbidva 3176	. 2 ⊢ (𝜑 → (∃𝑦 ∈ 𝑃 ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾‘𝐸)𝐷 ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ ∃𝑦 ∈ 𝑃 (𝑦 = 𝐷 ∧ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹))))
55		id 22	. . . . . . . 8 ⊢ (𝑦 = 𝐷 → 𝑦 = 𝐷)
56		eqidd 2733	. . . . . . . 8 ⊢ (𝑦 = 𝐷 → 𝐸 = 𝐸)
57		eqidd 2733	. . . . . . . 8 ⊢ (𝑦 = 𝐷 → 𝑥 = 𝑥)
58	55, 56, 57	s3eqd 14811	. . . . . . 7 ⊢ (𝑦 = 𝐷 → ⟨“𝑦𝐸𝑥”⟩ = ⟨“𝐷𝐸𝑥”⟩)
59	58	breq2d 5159	. . . . . 6 ⊢ (𝑦 = 𝐷 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩))
60	59	anbi1d 630	. . . . 5 ⊢ (𝑦 = 𝐷 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
61	60	rexbidv 3178	. . . 4 ⊢ (𝑦 = 𝐷 → (∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹) ↔ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
62	61	ceqsrexv 3642	. . 3 ⊢ (𝐷 ∈ 𝑃 → (∃𝑦 ∈ 𝑃 (𝑦 = 𝐷 ∧ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)) ↔ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
63	8, 62	syl 17	. 2 ⊢ (𝜑 → (∃𝑦 ∈ 𝑃 (𝑦 = 𝐷 ∧ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)) ↔ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))
64	11, 54, 63	3bitrd 304	1 ⊢ (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥 ∈ 𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾‘𝐸)𝐹)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∃wrex 3070 class class class wbr 5147 ‘cfv 6540 (class class class)co 7405 ⟨“cs3 14789 Basecbs 17140 distcds 17202 TarskiGcstrkg 27667 Itvcitv 27673 cgrGccgrg 27750 hlGchlg 27840 cgrAccgra 28047

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-dju 9892 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-xnn0 12541 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-hash 14287 df-word 14461 df-concat 14517 df-s1 14542 df-s2 14795 df-s3 14796 df-trkgc 27688 df-trkgb 27689 df-trkgcb 27690 df-trkg 27693 df-cgrg 27751 df-hlg 27841 df-cgra 28048

This theorem is referenced by: acopyeu 28074

W3C validator