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

Theorem trgcopyeu 27167
Description: Triangle construction: a copy of a given triangle can always be constructed in such a way that one side is lying on a half-line, and the third vertex is on a given half-plane: uniqueness part. Second part of Theorem 10.16 of [Schwabhauser] p. 92. (Contributed by Thierry Arnoux, 8-Aug-2020.)
Hypotheses
Ref Expression
trgcopy.p 𝑃 = (Base‘𝐺)
trgcopy.m = (dist‘𝐺)
trgcopy.i 𝐼 = (Itv‘𝐺)
trgcopy.l 𝐿 = (LineG‘𝐺)
trgcopy.k 𝐾 = (hlG‘𝐺)
trgcopy.g (𝜑𝐺 ∈ TarskiG)
trgcopy.a (𝜑𝐴𝑃)
trgcopy.b (𝜑𝐵𝑃)
trgcopy.c (𝜑𝐶𝑃)
trgcopy.d (𝜑𝐷𝑃)
trgcopy.e (𝜑𝐸𝑃)
trgcopy.f (𝜑𝐹𝑃)
trgcopy.1 (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
trgcopy.2 (𝜑 → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
trgcopy.3 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
Assertion
Ref Expression
trgcopyeu (𝜑 → ∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
Distinct variable groups:   ,𝑓   𝐴,𝑓   𝐵,𝑓   𝐶,𝑓   𝐷,𝑓   𝑓,𝐸   𝑓,𝐹   𝑓,𝐺   𝑓,𝐼   𝑓,𝐿   𝑃,𝑓   𝜑,𝑓   𝑓,𝐾

Proof of Theorem trgcopyeu
Dummy variables 𝑎 𝑏 𝑘 𝑡 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trgcopy.p . . 3 𝑃 = (Base‘𝐺)
2 trgcopy.m . . 3 = (dist‘𝐺)
3 trgcopy.i . . 3 𝐼 = (Itv‘𝐺)
4 trgcopy.l . . 3 𝐿 = (LineG‘𝐺)
5 trgcopy.k . . 3 𝐾 = (hlG‘𝐺)
6 trgcopy.g . . 3 (𝜑𝐺 ∈ TarskiG)
7 trgcopy.a . . 3 (𝜑𝐴𝑃)
8 trgcopy.b . . 3 (𝜑𝐵𝑃)
9 trgcopy.c . . 3 (𝜑𝐶𝑃)
10 trgcopy.d . . 3 (𝜑𝐷𝑃)
11 trgcopy.e . . 3 (𝜑𝐸𝑃)
12 trgcopy.f . . 3 (𝜑𝐹𝑃)
13 trgcopy.1 . . 3 (𝜑 → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
14 trgcopy.2 . . 3 (𝜑 → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
15 trgcopy.3 . . 3 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
161, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15trgcopy 27165 . 2 (𝜑 → ∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
176ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐺 ∈ TarskiG)
187ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐴𝑃)
198ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐵𝑃)
209ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐶𝑃)
2110ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐷𝑃)
2211ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐸𝑃)
2312ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐹𝑃)
2413ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
2514ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
2615ad5antr 731 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (𝐴 𝐵) = (𝐷 𝐸))
27 simpl 483 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑥 = 𝑎)
2827eleq1d 2823 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
29 simpr 485 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑦 = 𝑏)
3029eleq1d 2823 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
3128, 30anbi12d 631 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ↔ (𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸)))))
32 simpr 485 . . . . . . . . . . 11 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑧 = 𝑡)
33 simpll 764 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑥 = 𝑎)
34 simplr 766 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑦 = 𝑏)
3533, 34oveq12d 7293 . . . . . . . . . . 11 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑥𝐼𝑦) = (𝑎𝐼𝑏))
3632, 35eleq12d 2833 . . . . . . . . . 10 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑡 ∈ (𝑎𝐼𝑏)))
3736cbvrexdva 3395 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → (∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦) ↔ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏)))
3831, 37anbi12d 631 . . . . . . . 8 ((𝑥 = 𝑎𝑦 = 𝑏) → (((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦)) ↔ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))))
3938cbvopabv 5147 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))}
40 simp-5r 783 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓𝑃)
41 simp-4r 781 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑘𝑃)
42 simpllr 773 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
4342simpld 495 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩)
44 simplr 766 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩)
4542simprd 496 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
46 simpr 485 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
471, 2, 3, 4, 5, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 39, 40, 41, 43, 44, 45, 46trgcopyeulem 27166 . . . . . 6 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓 = 𝑘)
4847anasss 467 . . . . 5 (((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)
4948expl 458 . . . 4 (((𝜑𝑓𝑃) ∧ 𝑘𝑃) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5049anasss 467 . . 3 ((𝜑 ∧ (𝑓𝑃𝑘𝑃)) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5150ralrimivva 3123 . 2 (𝜑 → ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
52 eqidd 2739 . . . . . 6 (𝑓 = 𝑘𝐷 = 𝐷)
53 eqidd 2739 . . . . . 6 (𝑓 = 𝑘𝐸 = 𝐸)
54 id 22 . . . . . 6 (𝑓 = 𝑘𝑓 = 𝑘)
5552, 53, 54s3eqd 14577 . . . . 5 (𝑓 = 𝑘 → ⟨“𝐷𝐸𝑓”⟩ = ⟨“𝐷𝐸𝑘”⟩)
5655breq2d 5086 . . . 4 (𝑓 = 𝑘 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩))
57 breq1 5077 . . . 4 (𝑓 = 𝑘 → (𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
5856, 57anbi12d 631 . . 3 (𝑓 = 𝑘 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
5958reu4 3666 . 2 (∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)))
6016, 51, 59sylanbrc 583 1 (𝜑 → ∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 844   = wceq 1539  wcel 2106  wral 3064  wrex 3065  ∃!wreu 3066  cdif 3884   class class class wbr 5074  {copab 5136  cfv 6433  (class class class)co 7275  ⟨“cs3 14555  Basecbs 16912  distcds 16971  TarskiGcstrkg 26788  Itvcitv 26794  LineGclng 26795  cgrGccgrg 26871  hlGchlg 26961  hpGchpg 27118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-oadd 8301  df-er 8498  df-map 8617  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-dju 9659  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-xnn0 12306  df-z 12320  df-uz 12583  df-fz 13240  df-fzo 13383  df-hash 14045  df-word 14218  df-concat 14274  df-s1 14301  df-s2 14561  df-s3 14562  df-trkgc 26809  df-trkgb 26810  df-trkgcb 26811  df-trkgld 26813  df-trkg 26814  df-cgrg 26872  df-ismt 26894  df-leg 26944  df-hlg 26962  df-mir 27014  df-rag 27055  df-perpg 27057  df-hpg 27119  df-mid 27135  df-lmi 27136
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator