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

Theorem iscgra1 29077
Description: A special version of iscgra 29076 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 29076 . 2 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑦𝑃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)))
129ad3antrrr 742 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐸𝑃)
136ad3antrrr 742 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐵𝑃)
145ad3antrrr 742 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐴𝑃)
154ad3antrrr 742 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐺 ∈ TarskiG)
168ad3antrrr 742 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷𝑃)
17 iscgra1.m . . . . . . . 8 = (dist‘𝐺)
18 simpllr 787 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦𝑃)
19 simpr2 1212 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦(𝐾𝐸)𝐷)
201, 2, 3, 18, 16, 12, 15, 19hlne2 28840 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷𝐸)
21 iscgra1.1 . . . . . . . . . 10 (𝜑𝐴𝐵)
2221ad3antrrr 742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐴𝐵)
2322necomd 3019 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐵𝐴)
241, 2, 3, 16, 12, 12, 15, 20hlid 28843 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷(𝐾𝐸)𝐷)
25 eqid 2769 . . . . . . . . . . 11 (cgrG‘𝐺) = (cgrG‘𝐺)
267ad3antrrr 742 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐶𝑃)
27 simplr 780 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑥𝑃)
28 simpr1 1211 . . . . . . . . . . 11 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
291, 17, 2, 25, 15, 14, 13, 26, 18, 12, 27, 28cgr3simp1 28754 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝑦 𝐸))
3029eqcomd 2775 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝑦 𝐸) = (𝐴 𝐵))
311, 17, 2, 15, 18, 12, 14, 13, 30tgcgrcomlr 28714 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝑦) = (𝐵 𝐴))
32 iscgra1.2 . . . . . . . . . . 11 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
3332ad3antrrr 742 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝐷 𝐸))
3433eqcomd 2775 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐷 𝐸) = (𝐴 𝐵))
351, 17, 2, 15, 16, 12, 14, 13, 34tgcgrcomlr 28714 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝐷) = (𝐵 𝐴))
361, 2, 3, 12, 13, 14, 15, 16, 17, 20, 23, 18, 16, 19, 24, 31, 35hlcgreulem 28851 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑦 = 𝐷)
37 simpr3 1213 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝑥(𝐾𝐸)𝐹)
3836, 28, 37jca32 524 . . . . . 6 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
39 simprrl 792 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩)
40 simprl 782 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑦 = 𝐷)
418ad3antrrr 742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷𝑃)
429ad3antrrr 742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐸𝑃)
434ad3antrrr 742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐺 ∈ TarskiG)
441, 17, 2, 4, 5, 6, 8, 9, 32, 21tgcgrneq 28717 . . . . . . . . . 10 (𝜑𝐷𝐸)
4544ad3antrrr 742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷𝐸)
461, 2, 3, 41, 41, 42, 43, 45hlid 28843 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷(𝐾𝐸)𝐷)
4740, 46eqbrtrd 5137 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑦(𝐾𝐸)𝐷)
48 simprrr 793 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑥(𝐾𝐸)𝐹)
4939, 47, 483jca 1144 . . . . . 6 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹))
5038, 49impbida 812 . . . . 5 (((𝜑𝑦𝑃) ∧ 𝑥𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5150rexbidva 3193 . . . 4 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
52 r19.42v 3203 . . . 4 (∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
5351, 52bitrdi 290 . . 3 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5453rexbidva 3193 . 2 (𝜑 → (∃𝑦𝑃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
55 id 23 . . . . . . . 8 (𝑦 = 𝐷𝑦 = 𝐷)
56 eqidd 2770 . . . . . . . 8 (𝑦 = 𝐷𝐸 = 𝐸)
57 eqidd 2770 . . . . . . . 8 (𝑦 = 𝐷𝑥 = 𝑥)
5855, 56, 57s3eqd 14900 . . . . . . 7 (𝑦 = 𝐷 → ⟨“𝑦𝐸𝑥”⟩ = ⟨“𝐷𝐸𝑥”⟩)
5958breq2d 5125 . . . . . 6 (𝑦 = 𝐷 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩))
6059anbi1d 642 . . . . 5 (𝑦 = 𝐷 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6160rexbidv 3195 . . . 4 (𝑦 = 𝐷 → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6261ceqsrexv 3623 . . 3 (𝐷𝑃 → (∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
638, 62syl 18 . 2 (𝜑 → (∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6411, 54, 633bitrd 308 1 (𝜑 → (⟨“𝐴𝐵𝐶”⟩(cgrA‘𝐺)⟨“𝐷𝐸𝐹”⟩ ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wne 2964  wrex 3095   class class class wbr 5113  cfv 6537  (class class class)co 7411  ⟨“cs3 14878  Basecbs 17268  distcds 17318  TarskiGcstrkg 28661  Itvcitv 28667  cgrGccgrg 28744  hlGchlg 28834  cgrAccgra 29074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11155  ax-resscn 11156  ax-1cn 11157  ax-icn 11158  ax-addcl 11159  ax-addrcl 11160  ax-mulcl 11161  ax-mulrcl 11162  ax-mulcom 11163  ax-addass 11164  ax-mulass 11165  ax-distr 11166  ax-i2m1 11167  ax-1ne0 11168  ax-1rid 11169  ax-rnegex 11170  ax-rrecex 11171  ax-cnre 11172  ax-pre-lttri 11173  ax-pre-lttrn 11174  ax-pre-ltadd 11175  ax-pre-mulgt0 11176
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8452  df-oadd 8456  df-er 8693  df-map 8825  df-pm 8826  df-en 8943  df-dom 8944  df-sdom 8945  df-fin 8946  df-dju 9886  df-card 9924  df-pnf 11244  df-mnf 11245  df-xr 11246  df-ltxr 11247  df-le 11248  df-sub 11442  df-neg 11443  df-nn 12233  df-2 12302  df-3 12303  df-n0 12504  df-xnn0 12577  df-z 12591  df-uz 12862  df-fz 13535  df-fzo 13682  df-hash 14366  df-word 14550  df-concat 14607  df-s1 14633  df-s2 14884  df-s3 14885  df-trkgc 28682  df-trkgb 28683  df-trkgcb 28684  df-trkg 28687  df-cgrg 28745  df-hlg 28835  df-cgra 29075
This theorem is referenced by:  acopyeu  29101
  Copyright terms: Public domain W3C validator