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

Theorem trgcopyeu 25498
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 25496 . 2 (𝜑 → ∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
176ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐺 ∈ TarskiG)
187ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐴𝑃)
198ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐵𝑃)
209ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐶𝑃)
2110ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐷𝑃)
2211ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐸𝑃)
2312ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝐹𝑃)
2413ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐴 ∈ (𝐵𝐿𝐶) ∨ 𝐵 = 𝐶))
2514ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ¬ (𝐷 ∈ (𝐸𝐿𝐹) ∨ 𝐸 = 𝐹))
2615ad5antr 766 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (𝐴 𝐵) = (𝐷 𝐸))
27 simpl 472 . . . . . . . . . . . 12 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑥 = 𝑎)
2827eleq1d 2672 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
29 simpr 476 . . . . . . . . . . . 12 ((𝑥 = 𝑎𝑦 = 𝑏) → 𝑦 = 𝑏)
3029eleq1d 2672 . . . . . . . . . . 11 ((𝑥 = 𝑎𝑦 = 𝑏) → (𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ↔ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))))
3128, 30anbi12d 743 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ↔ (𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸)))))
32 simpr 476 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑧 = 𝑡)
33 simpll 786 . . . . . . . . . . . . 13 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑥 = 𝑎)
34 simplr 788 . . . . . . . . . . . . 13 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → 𝑦 = 𝑏)
3533, 34oveq12d 6567 . . . . . . . . . . . 12 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑥𝐼𝑦) = (𝑎𝐼𝑏))
3632, 35eleq12d 2682 . . . . . . . . . . 11 (((𝑥 = 𝑎𝑦 = 𝑏) ∧ 𝑧 = 𝑡) → (𝑧 ∈ (𝑥𝐼𝑦) ↔ 𝑡 ∈ (𝑎𝐼𝑏)))
3736cbvrexdva 3154 . . . . . . . . . 10 ((𝑥 = 𝑎𝑦 = 𝑏) → (∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦) ↔ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏)))
3831, 37anbi12d 743 . . . . . . . . 9 ((𝑥 = 𝑎𝑦 = 𝑏) → (((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦)) ↔ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))))
3938cbvopabv 4654 . . . . . . . 8 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑦 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑧 ∈ (𝐷𝐿𝐸)𝑧 ∈ (𝑥𝐼𝑦))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ (𝐷𝐿𝐸)) ∧ 𝑏 ∈ (𝑃 ∖ (𝐷𝐿𝐸))) ∧ ∃𝑡 ∈ (𝐷𝐿𝐸)𝑡 ∈ (𝑎𝐼𝑏))}
40 simp-5r 805 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓𝑃)
41 simp-4r 803 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑘𝑃)
42 simpllr 795 . . . . . . . . 9 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
4342simpld 474 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩)
44 simplr 788 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩)
4542simprd 478 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)
46 simpr 476 . . . . . . . 8 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(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 25497 . . . . . . 7 ((((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩) ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) → 𝑓 = 𝑘)
4847anasss 677 . . . . . 6 (((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)
4948anasss 677 . . . . 5 ((((𝜑𝑓𝑃) ∧ 𝑘𝑃) ∧ ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))) → 𝑓 = 𝑘)
5049ex 449 . . . 4 (((𝜑𝑓𝑃) ∧ 𝑘𝑃) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5150anasss 677 . . 3 ((𝜑 ∧ (𝑓𝑃𝑘𝑃)) → (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
5251ralrimivva 2954 . 2 (𝜑 → ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘))
53 eqidd 2611 . . . . . 6 (𝑓 = 𝑘𝐷 = 𝐷)
54 eqidd 2611 . . . . . 6 (𝑓 = 𝑘𝐸 = 𝐸)
55 id 22 . . . . . 6 (𝑓 = 𝑘𝑓 = 𝑘)
5653, 54, 55s3eqd 13460 . . . . 5 (𝑓 = 𝑘 → ⟨“𝐷𝐸𝑓”⟩ = ⟨“𝐷𝐸𝑘”⟩)
5756breq2d 4595 . . . 4 (𝑓 = 𝑘 → (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ↔ ⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩))
58 breq1 4586 . . . 4 (𝑓 = 𝑘 → (𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
5957, 58anbi12d 743 . . 3 (𝑓 = 𝑘 → ((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)))
6059reu4 3367 . 2 (∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ↔ (∃𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ ∀𝑓𝑃𝑘𝑃 (((⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹) ∧ (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑘”⟩ ∧ 𝑘((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹)) → 𝑓 = 𝑘)))
6116, 52, 60sylanbrc 695 1 (𝜑 → ∃!𝑓𝑃 (⟨“𝐴𝐵𝐶”⟩(cgrG‘𝐺)⟨“𝐷𝐸𝑓”⟩ ∧ 𝑓((hpG‘𝐺)‘(𝐷𝐿𝐸))𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wo 382  wa 383   = wceq 1475  wcel 1977  wral 2896  wrex 2897  ∃!wreu 2898  cdif 3537   class class class wbr 4583  {copab 4642  cfv 5804  (class class class)co 6549  ⟨“cs3 13438  Basecbs 15695  distcds 15777  TarskiGcstrkg 25129  Itvcitv 25135  LineGclng 25136  cgrGccgrg 25205  hlGchlg 25295  hpGchpg 25449
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-concat 13156  df-s1 13157  df-s2 13444  df-s3 13445  df-trkgc 25147  df-trkgb 25148  df-trkgcb 25149  df-trkgld 25151  df-trkg 25152  df-cgrg 25206  df-ismt 25228  df-leg 25278  df-hlg 25296  df-mir 25348  df-rag 25389  df-perpg 25391  df-hpg 25450  df-mid 25466  df-lmi 25467
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator