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

Theorem iscgra1 28786
Description: A special version of iscgra 28785 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.
StepHypRef 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 (𝜑𝐹𝑃)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10iscgra 28785 . 2 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑦𝑃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)))
129ad3antrrr 730 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐸𝑃)
136ad3antrrr 730 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐵𝑃)
145ad3antrrr 730 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐴𝑃)
154ad3antrrr 730 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐺 ∈ TarskiG)
168ad3antrrr 730 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷𝑃)
17 iscgra1.m . . . . . . . 8 = (dist‘𝐺)
18 simpllr 775 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦𝑃)
19 simpr2 1196 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦(𝐾𝐸)𝐷)
201, 2, 3, 18, 16, 12, 15, 19hlne2 28582 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷𝐸)
21 iscgra1.1 . . . . . . . . . 10 (𝜑𝐴𝐵)
2221ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐴𝐵)
2322necomd 2983 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐵𝐴)
241, 2, 3, 16, 12, 12, 15, 20hlid 28585 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷(𝐾𝐸)𝐷)
25 eqid 2731 . . . . . . . . . . 11 (cgrG‘𝐺) = (cgrG‘𝐺)
267ad3antrrr 730 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐶𝑃)
27 simplr 768 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑥𝑃)
28 simpr1 1195 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
291, 17, 2, 25, 15, 14, 13, 26, 18, 12, 27, 28cgr3simp1 28496 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝑦 𝐸))
3029eqcomd 2737 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝑦 𝐸) = (𝐴 𝐵))
311, 17, 2, 15, 18, 12, 14, 13, 30tgcgrcomlr 28456 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝑦) = (𝐵 𝐴))
32 iscgra1.2 . . . . . . . . . . 11 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
3332ad3antrrr 730 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝐷 𝐸))
3433eqcomd 2737 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐷 𝐸) = (𝐴 𝐵))
351, 17, 2, 15, 16, 12, 14, 13, 34tgcgrcomlr 28456 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝐷) = (𝐵 𝐴))
361, 2, 3, 12, 13, 14, 15, 16, 17, 20, 23, 18, 16, 19, 24, 31, 35hlcgreulem 28593 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦 = 𝐷)
37 simpr3 1197 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑥(𝐾𝐸)𝐹)
3836, 28, 37jca32 515 . . . . . 6 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
39 simprrl 780 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
40 simprl 770 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑦 = 𝐷)
418ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷𝑃)
429ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐸𝑃)
434ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐺 ∈ TarskiG)
441, 17, 2, 4, 5, 6, 8, 9, 32, 21tgcgrneq 28459 . . . . . . . . . 10 (𝜑𝐷𝐸)
4544ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷𝐸)
461, 2, 3, 41, 41, 42, 43, 45hlid 28585 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷(𝐾𝐸)𝐷)
4740, 46eqbrtrd 5113 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑦(𝐾𝐸)𝐷)
48 simprrr 781 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑥(𝐾𝐸)𝐹)
4939, 47, 483jca 1128 . . . . . 6 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹))
5038, 49impbida 800 . . . . 5 (((𝜑𝑦𝑃) ∧ 𝑥𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5150rexbidva 3154 . . . 4 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
52 r19.42v 3164 . . . 4 (∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
5351, 52bitrdi 287 . . 3 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5453rexbidva 3154 . 2 (𝜑 → (∃𝑦𝑃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
55 id 22 . . . . . . . 8 (𝑦 = 𝐷𝑦 = 𝐷)
56 eqidd 2732 . . . . . . . 8 (𝑦 = 𝐷𝐸 = 𝐸)
57 eqidd 2732 . . . . . . . 8 (𝑦 = 𝐷𝑥 = 𝑥)
5855, 56, 57s3eqd 14768 . . . . . . 7 (𝑦 = 𝐷 → ⟨“𝑦𝐸𝑥”⟩ = ⟨“𝐷𝐸𝑥”⟩)
5958breq2d 5103 . . . . . 6 (𝑦 = 𝐷 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩))
6059anbi1d 631 . . . . 5 (𝑦 = 𝐷 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6160rexbidv 3156 . . . 4 (𝑦 = 𝐷 → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6261ceqsrexv 3610 . . 3 (𝐷𝑃 → (∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
638, 62syl 17 . 2 (𝜑 → (∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6411, 54, 633bitrd 305 1 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2111  wne 2928  wrex 3056   class class class wbr 5091  cfv 6481  (class class class)co 7346  ⟨“cs3 14746  Basecbs 17117  distcds 17167  TarskiGcstrkg 28403  Itvcitv 28409  cgrGccgrg 28486  hlGchlg 28576  cgrAccgra 28783
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11059  ax-resscn 11060  ax-1cn 11061  ax-icn 11062  ax-addcl 11063  ax-addrcl 11064  ax-mulcl 11065  ax-mulrcl 11066  ax-mulcom 11067  ax-addass 11068  ax-mulass 11069  ax-distr 11070  ax-i2m1 11071  ax-1ne0 11072  ax-1rid 11073  ax-rnegex 11074  ax-rrecex 11075  ax-cnre 11076  ax-pre-lttri 11077  ax-pre-lttrn 11078  ax-pre-ltadd 11079  ax-pre-mulgt0 11080
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-tp 4581  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-oadd 8389  df-er 8622  df-map 8752  df-pm 8753  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873  df-dju 9791  df-card 9829  df-pnf 11145  df-mnf 11146  df-xr 11147  df-ltxr 11148  df-le 11149  df-sub 11343  df-neg 11344  df-nn 12123  df-2 12185  df-3 12186  df-n0 12379  df-xnn0 12452  df-z 12466  df-uz 12730  df-fz 13405  df-fzo 13552  df-hash 14235  df-word 14418  df-concat 14475  df-s1 14501  df-s2 14752  df-s3 14753  df-trkgc 28424  df-trkgb 28425  df-trkgcb 28426  df-trkg 28429  df-cgrg 28487  df-hlg 28577  df-cgra 28784
This theorem is referenced by:  acopyeu  28810
  Copyright terms: Public domain W3C validator