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

Theorem foot 28649
Description: From a point 𝐶 outside of a line 𝐴, there exists a unique point 𝑥 on 𝐴 such that (𝐶𝐿𝑥) is perpendicular to 𝐴. That point is called the foot from 𝐶 on 𝐴. Theorem 8.18 of [Schwabhauser] p. 60. (Contributed by Thierry Arnoux, 19-Oct-2019.)
Hypotheses
Ref Expression
isperp.p 𝑃 = (Base‘𝐺)
isperp.d = (dist‘𝐺)
isperp.i 𝐼 = (Itv‘𝐺)
isperp.l 𝐿 = (LineG‘𝐺)
isperp.g (𝜑𝐺 ∈ TarskiG)
isperp.a (𝜑𝐴 ∈ ran 𝐿)
foot.x (𝜑𝐶𝑃)
foot.y (𝜑 → ¬ 𝐶𝐴)
Assertion
Ref Expression
foot (𝜑 → ∃!𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝜑,𝑥   𝑥,𝐶   𝑥,𝐼   𝑥,   𝑥,𝐿   𝑥,𝑃

Proof of Theorem foot
Dummy variables 𝑢 𝑣 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isperp.p . . 3 𝑃 = (Base‘𝐺)
2 isperp.d . . 3 = (dist‘𝐺)
3 isperp.i . . 3 𝐼 = (Itv‘𝐺)
4 isperp.l . . 3 𝐿 = (LineG‘𝐺)
5 isperp.g . . 3 (𝜑𝐺 ∈ TarskiG)
6 isperp.a . . 3 (𝜑𝐴 ∈ ran 𝐿)
7 foot.x . . 3 (𝜑𝐶𝑃)
8 foot.y . . 3 (𝜑 → ¬ 𝐶𝐴)
91, 2, 3, 4, 5, 6, 7, 8footex 28648 . 2 (𝜑 → ∃𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
10 eqid 2729 . . . . . 6 (pInvG‘𝐺) = (pInvG‘𝐺)
115ad2antrr 726 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐺 ∈ TarskiG)
127ad2antrr 726 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶𝑃)
135adantr 480 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝐺 ∈ TarskiG)
146adantr 480 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝐴 ∈ ran 𝐿)
15 simprl 770 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥𝐴)
161, 4, 3, 13, 14, 15tglnpt 28476 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥𝑃)
1716adantr 480 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥𝑃)
18 simprr 772 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧𝐴)
191, 4, 3, 13, 14, 18tglnpt 28476 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧𝑃)
2019adantr 480 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑧𝑃)
218adantr 480 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → ¬ 𝐶𝐴)
22 nelne2 3023 . . . . . . . . . . 11 ((𝑥𝐴 ∧ ¬ 𝐶𝐴) → 𝑥𝐶)
2315, 21, 22syl2anc 584 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥𝐶)
2423necomd 2980 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝐶𝑥)
2524adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶𝑥)
261, 3, 4, 11, 12, 17, 25tglinerflx1 28560 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶 ∈ (𝐶𝐿𝑥))
2718adantr 480 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑧𝐴)
28 simprl 770 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
297adantr 480 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝐶𝑃)
301, 3, 4, 13, 29, 16, 24tgelrnln 28557 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (𝐶𝐿𝑥) ∈ ran 𝐿)
311, 3, 4, 13, 29, 16, 24tglinerflx2 28561 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥 ∈ (𝐶𝐿𝑥))
3231, 15elind 4163 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥 ∈ ((𝐶𝐿𝑥) ∩ 𝐴))
331, 2, 3, 4, 13, 30, 14, 32isperp2 28642 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑥)∀𝑣𝐴 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
3433adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑥)∀𝑣𝐴 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
3528, 34mpbid 232 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ∀𝑢 ∈ (𝐶𝐿𝑥)∀𝑣𝐴 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))
36 id 22 . . . . . . . . . 10 (𝑢 = 𝐶𝑢 = 𝐶)
37 eqidd 2730 . . . . . . . . . 10 (𝑢 = 𝐶𝑥 = 𝑥)
38 eqidd 2730 . . . . . . . . . 10 (𝑢 = 𝐶𝑣 = 𝑣)
3936, 37, 38s3eqd 14830 . . . . . . . . 9 (𝑢 = 𝐶 → ⟨“𝑢𝑥𝑣”⟩ = ⟨“𝐶𝑥𝑣”⟩)
4039eleq1d 2813 . . . . . . . 8 (𝑢 = 𝐶 → (⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
41 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑧𝐶 = 𝐶)
42 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑧𝑥 = 𝑥)
43 id 22 . . . . . . . . . 10 (𝑣 = 𝑧𝑣 = 𝑧)
4441, 42, 43s3eqd 14830 . . . . . . . . 9 (𝑣 = 𝑧 → ⟨“𝐶𝑥𝑣”⟩ = ⟨“𝐶𝑥𝑧”⟩)
4544eleq1d 2813 . . . . . . . 8 (𝑣 = 𝑧 → (⟨“𝐶𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑥𝑧”⟩ ∈ (∟G‘𝐺)))
4640, 45rspc2va 3600 . . . . . . 7 (((𝐶 ∈ (𝐶𝐿𝑥) ∧ 𝑧𝐴) ∧ ∀𝑢 ∈ (𝐶𝐿𝑥)∀𝑣𝐴 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)) → ⟨“𝐶𝑥𝑧”⟩ ∈ (∟G‘𝐺))
4726, 27, 35, 46syl21anc 837 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ⟨“𝐶𝑥𝑧”⟩ ∈ (∟G‘𝐺))
48 nelne2 3023 . . . . . . . . . . 11 ((𝑧𝐴 ∧ ¬ 𝐶𝐴) → 𝑧𝐶)
4918, 21, 48syl2anc 584 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧𝐶)
5049necomd 2980 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝐶𝑧)
5150adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶𝑧)
521, 3, 4, 11, 12, 20, 51tglinerflx1 28560 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶 ∈ (𝐶𝐿𝑧))
5315adantr 480 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥𝐴)
54 simprr 772 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)
551, 3, 4, 13, 29, 19, 50tgelrnln 28557 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (𝐶𝐿𝑧) ∈ ran 𝐿)
561, 3, 4, 13, 29, 19, 50tglinerflx2 28561 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧 ∈ (𝐶𝐿𝑧))
5756, 18elind 4163 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧 ∈ ((𝐶𝐿𝑧) ∩ 𝐴))
581, 2, 3, 4, 13, 55, 14, 57isperp2 28642 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → ((𝐶𝐿𝑧)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
5958adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ((𝐶𝐿𝑧)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
6054, 59mpbid 232 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺))
61 eqidd 2730 . . . . . . . . . 10 (𝑢 = 𝐶𝑧 = 𝑧)
6236, 61, 38s3eqd 14830 . . . . . . . . 9 (𝑢 = 𝐶 → ⟨“𝑢𝑧𝑣”⟩ = ⟨“𝐶𝑧𝑣”⟩)
6362eleq1d 2813 . . . . . . . 8 (𝑢 = 𝐶 → (⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
64 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑥𝐶 = 𝐶)
65 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑥𝑧 = 𝑧)
66 id 22 . . . . . . . . . 10 (𝑣 = 𝑥𝑣 = 𝑥)
6764, 65, 66s3eqd 14830 . . . . . . . . 9 (𝑣 = 𝑥 → ⟨“𝐶𝑧𝑣”⟩ = ⟨“𝐶𝑧𝑥”⟩)
6867eleq1d 2813 . . . . . . . 8 (𝑣 = 𝑥 → (⟨“𝐶𝑧𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺)))
6963, 68rspc2va 3600 . . . . . . 7 (((𝐶 ∈ (𝐶𝐿𝑧) ∧ 𝑥𝐴) ∧ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)) → ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺))
7052, 53, 60, 69syl21anc 837 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺))
711, 2, 3, 4, 10, 11, 12, 17, 20, 47, 70ragflat 28631 . . . . 5 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥 = 𝑧)
7271ex 412 . . . 4 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
7372ralrimivva 3180 . . 3 (𝜑 → ∀𝑥𝐴𝑧𝐴 (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
74 oveq2 7395 . . . . 5 (𝑥 = 𝑧 → (𝐶𝐿𝑥) = (𝐶𝐿𝑧))
7574breq1d 5117 . . . 4 (𝑥 = 𝑧 → ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴))
7675rmo4 3701 . . 3 (∃*𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ ∀𝑥𝐴𝑧𝐴 (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
7773, 76sylibr 234 . 2 (𝜑 → ∃*𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
78 reu5 3356 . 2 (∃!𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ (∃𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ ∃*𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴))
799, 77, 78sylanbrc 583 1 (𝜑 → ∃!𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wne 2925  wral 3044  wrex 3053  ∃!wreu 3352  ∃*wrmo 3353   class class class wbr 5107  ran crn 5639  cfv 6511  (class class class)co 7387  ⟨“cs3 14808  Basecbs 17179  distcds 17229  TarskiGcstrkg 28354  Itvcitv 28360  LineGclng 28361  pInvGcmir 28579  ∟Gcrag 28620  ⟂Gcperpg 28622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-er 8671  df-map 8801  df-pm 8802  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-dju 9854  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-3 12250  df-n0 12443  df-xnn0 12516  df-z 12530  df-uz 12794  df-fz 13469  df-fzo 13616  df-hash 14296  df-word 14479  df-concat 14536  df-s1 14561  df-s2 14814  df-s3 14815  df-trkgc 28375  df-trkgb 28376  df-trkgcb 28377  df-trkg 28380  df-cgrg 28438  df-leg 28510  df-mir 28580  df-rag 28621  df-perpg 28623
This theorem is referenced by:  footeq  28651  mideulem2  28661  lmieu  28711
  Copyright terms: Public domain W3C validator