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

Theorem iscgra1 28882
Description: A special version of iscgra 28881 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 28881 . 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 28678 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷𝐸)
21 iscgra1.1 . . . . . . . . . 10 (𝜑𝐴𝐵)
2221ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐴𝐵)
2322necomd 2987 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐵𝐴)
241, 2, 3, 16, 12, 12, 15, 20hlid 28681 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → 𝐷(𝐾𝐸)𝐷)
25 eqid 2736 . . . . . . . . . . 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 28592 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝑦 𝐸))
3029eqcomd 2742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝑦 𝐸) = (𝐴 𝐵))
311, 17, 2, 15, 18, 12, 14, 13, 30tgcgrcomlr 28552 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝑦) = (𝐵 𝐴))
32 iscgra1.2 . . . . . . . . . . 11 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
3332ad3antrrr 730 . . . . . . . . . 10 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐴 𝐵) = (𝐷 𝐸))
3433eqcomd 2742 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐷 𝐸) = (𝐴 𝐵))
351, 17, 2, 15, 16, 12, 14, 13, 34tgcgrcomlr 28552 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹)) → (𝐸 𝐷) = (𝐵 𝐴))
361, 2, 3, 12, 13, 14, 15, 16, 17, 20, 23, 18, 16, 19, 24, 31, 35hlcgreulem 28689 . . . . . . 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 28555 . . . . . . . . . 10 (𝜑𝐷𝐸)
4544ad3antrrr 730 . . . . . . . . 9 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷𝐸)
461, 2, 3, 41, 41, 42, 43, 45hlid 28681 . . . . . . . 8 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝐷(𝐾𝐸)𝐷)
4740, 46eqbrtrd 5120 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑦(𝐾𝐸)𝐷)
48 simprrr 781 . . . . . . 7 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → 𝑥(𝐾𝐸)𝐹)
4939, 47, 483jca 1128 . . . . . 6 ((((𝜑𝑦𝑃) ∧ 𝑥𝑃) ∧ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹))
5038, 49impbida 800 . . . . 5 (((𝜑𝑦𝑃) ∧ 𝑥𝑃) → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5150rexbidva 3158 . . . 4 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
52 r19.42v 3168 . . . 4 (∃𝑥𝑃 (𝑦 = 𝐷 ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
5351, 52bitrdi 287 . . 3 ((𝜑𝑦𝑃) → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
5453rexbidva 3158 . 2 (𝜑 → (∃𝑦𝑃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑦(𝐾𝐸)𝐷𝑥(𝐾𝐸)𝐹) ↔ ∃𝑦𝑃 (𝑦 = 𝐷 ∧ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹))))
55 id 22 . . . . . . . 8 (𝑦 = 𝐷𝑦 = 𝐷)
56 eqidd 2737 . . . . . . . 8 (𝑦 = 𝐷𝐸 = 𝐸)
57 eqidd 2737 . . . . . . . 8 (𝑦 = 𝐷𝑥 = 𝑥)
5855, 56, 57s3eqd 14787 . . . . . . 7 (𝑦 = 𝐷 → ⟨“𝑦𝐸𝑥”⟩ = ⟨“𝐷𝐸𝑥”⟩)
5958breq2d 5110 . . . . . 6 (𝑦 = 𝐷 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩))
6059anbi1d 631 . . . . 5 (𝑦 = 𝐷 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6160rexbidv 3160 . . . 4 (𝑦 = 𝐷 → (∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝑦𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹) ↔ ∃𝑥𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑥”⟩ ∧ 𝑥(𝐾𝐸)𝐹)))
6261ceqsrexv 3609 . . 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 2113  wne 2932  wrex 3060   class class class wbr 5098  cfv 6492  (class class class)co 7358  ⟨“cs3 14765  Basecbs 17136  distcds 17186  TarskiGcstrkg 28499  Itvcitv 28505  cgrGccgrg 28582  hlGchlg 28672  cgrAccgra 28879
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-oadd 8401  df-er 8635  df-map 8765  df-pm 8766  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-dju 9813  df-card 9851  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-nn 12146  df-2 12208  df-3 12209  df-n0 12402  df-xnn0 12475  df-z 12489  df-uz 12752  df-fz 13424  df-fzo 13571  df-hash 14254  df-word 14437  df-concat 14494  df-s1 14520  df-s2 14771  df-s3 14772  df-trkgc 28520  df-trkgb 28521  df-trkgcb 28522  df-trkg 28525  df-cgrg 28583  df-hlg 28673  df-cgra 28880
This theorem is referenced by:  acopyeu  28906
  Copyright terms: Public domain W3C validator