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

Theorem trgcopyeu 26600
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 26598 . 2 (𝜑 → ∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
176ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐺 ∈ TarskiG)
187ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐴𝑃)
198ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐵𝑃)
209ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐶𝑃)
2110ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐷𝑃)
2211ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐸𝑃)
2312ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐹𝑃)
2413ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
2514ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
2615ad5antr 733 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (𝐴 𝐵) = (𝐷 𝐸))
27 simpl 486 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑥 = 𝑎)
2827eleq1d 2874 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
29 simpr 488 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑦 = 𝑏)
3029eleq1d 2874 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
3128, 30anbi12d 633 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ↔ (𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸)))))
32 simpr 488 . . . . . . . . . . 11 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑧 = 𝑡)
33 simpll 766 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑥 = 𝑎)
34 simplr 768 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑦 = 𝑏)
3533, 34oveq12d 7153 . . . . . . . . . . 11 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑥𝐼𝑦) = (𝑎𝐼𝑏))
3632, 35eleq12d 2884 . . . . . . . . . 10 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑡 ∈ (𝑎𝐼𝑏)))
3736cbvrexdva 3407 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → (∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦) ↔ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏)))
3831, 37anbi12d 633 . . . . . . . 8 ((𝑥 = 𝑎𝑦 = 𝑏) → (((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦)) ↔ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))))
3938cbvopabv 5102 . . . . . . 7 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))}
40 simp-5r 785 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓𝑃)
41 simp-4r 783 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑘𝑃)
42 simpllr 775 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
4342simpld 498 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩)
44 simplr 768 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩)
4542simprd 499 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
46 simpr 488 . . . . . . 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 26599 . . . . . 6 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓 = 𝑘)
4847anasss 470 . . . . 5 (((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)
4948expl 461 . . . 4 (((𝜑𝑓𝑃) ∧ 𝑘𝑃) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5049anasss 470 . . 3 ((𝜑 ∧ (𝑓𝑃𝑘𝑃)) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5150ralrimivva 3156 . 2 (𝜑 → ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
52 eqidd 2799 . . . . . 6 (𝑓 = 𝑘𝐷 = 𝐷)
53 eqidd 2799 . . . . . 6 (𝑓 = 𝑘𝐸 = 𝐸)
54 id 22 . . . . . 6 (𝑓 = 𝑘𝑓 = 𝑘)
5552, 53, 54s3eqd 14217 . . . . 5 (𝑓 = 𝑘 → ⟨“𝐷𝐸𝑓”⟩ = ⟨“𝐷𝐸𝑘”⟩)
5655breq2d 5042 . . . 4 (𝑓 = 𝑘 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩))
57 breq1 5033 . . . 4 (𝑓 = 𝑘 → (𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
5856, 57anbi12d 633 . . 3 (𝑓 = 𝑘 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
5958reu4 3670 . 2 (∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)))
6016, 51, 59sylanbrc 586 1 (𝜑 → ∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  wo 844   = wceq 1538  wcel 2111  wral 3106  wrex 3107  ∃!wreu 3108  cdif 3878   class class class wbr 5030  {copab 5092  cfv 6324  (class class class)co 7135  ⟨“cs3 14195  Basecbs 16475  distcds 16566  TarskiGcstrkg 26224  Itvcitv 26230  LineGclng 26231  cgrGccgrg 26304  hlGchlg 26394  hpGchpg 26551
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-pm 8392  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-dju 9314  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-xnn0 11956  df-z 11970  df-uz 12232  df-fz 12886  df-fzo 13029  df-hash 13687  df-word 13858  df-concat 13914  df-s1 13941  df-s2 14201  df-s3 14202  df-trkgc 26242  df-trkgb 26243  df-trkgcb 26244  df-trkgld 26246  df-trkg 26247  df-cgrg 26305  df-ismt 26327  df-leg 26377  df-hlg 26395  df-mir 26447  df-rag 26488  df-perpg 26490  df-hpg 26552  df-mid 26568  df-lmi 26569
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator