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

Theorem foot 28685
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 28684 . 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 28512 . . . . . . 7 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥𝑃)
1716adantr 480 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥𝑃)
18 simprr 772 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧𝐴)
191, 4, 3, 13, 14, 18tglnpt 28512 . . . . . . 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 28596 . . . . . . 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 28593 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (𝐶𝐿𝑥) ∈ ran 𝐿)
311, 3, 4, 13, 29, 16, 24tglinerflx2 28597 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥 ∈ (𝐶𝐿𝑥))
3231, 15elind 4153 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑥 ∈ ((𝐶𝐿𝑥) ∩ 𝐴))
331, 2, 3, 4, 13, 30, 14, 32isperp2 28678 . . . . . . . . 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 14789 . . . . . . . . 9 (𝑢 = 𝐶 → ⟨“𝑢𝑥𝑣”⟩ = ⟨“𝐶𝑥𝑣”⟩)
4039eleq1d 2813 . . . . . . . 8 (𝑢 = 𝐶 → (⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
41 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑧𝐶 = 𝐶)
42 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑧𝑥 = 𝑥)
43 id 22 . . . . . . . . . 10 (𝑣 = 𝑧𝑣 = 𝑧)
4441, 42, 43s3eqd 14789 . . . . . . . . 9 (𝑣 = 𝑧 → ⟨“𝐶𝑥𝑣”⟩ = ⟨“𝐶𝑥𝑧”⟩)
4544eleq1d 2813 . . . . . . . 8 (𝑣 = 𝑧 → (⟨“𝐶𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑥𝑧”⟩ ∈ (∟G‘𝐺)))
4640, 45rspc2va 3591 . . . . . . 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 28596 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝐶 ∈ (𝐶𝐿𝑧))
5315adantr 480 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥𝐴)
54 simprr 772 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)
551, 3, 4, 13, 29, 19, 50tgelrnln 28593 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (𝐶𝐿𝑧) ∈ ran 𝐿)
561, 3, 4, 13, 29, 19, 50tglinerflx2 28597 . . . . . . . . . . 11 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧 ∈ (𝐶𝐿𝑧))
5756, 18elind 4153 . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → 𝑧 ∈ ((𝐶𝐿𝑧) ∩ 𝐴))
581, 2, 3, 4, 13, 55, 14, 57isperp2 28678 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → ((𝐶𝐿𝑧)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
5958adantr 480 . . . . . . . 8 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ((𝐶𝐿𝑧)(⟂G‘𝐺)𝐴 ↔ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
6054, 59mpbid 232 . . . . . . 7 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺))
61 eqidd 2730 . . . . . . . . . 10 (𝑢 = 𝐶𝑧 = 𝑧)
6236, 61, 38s3eqd 14789 . . . . . . . . 9 (𝑢 = 𝐶 → ⟨“𝑢𝑧𝑣”⟩ = ⟨“𝐶𝑧𝑣”⟩)
6362eleq1d 2813 . . . . . . . 8 (𝑢 = 𝐶 → (⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑧𝑣”⟩ ∈ (∟G‘𝐺)))
64 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑥𝐶 = 𝐶)
65 eqidd 2730 . . . . . . . . . 10 (𝑣 = 𝑥𝑧 = 𝑧)
66 id 22 . . . . . . . . . 10 (𝑣 = 𝑥𝑣 = 𝑥)
6764, 65, 66s3eqd 14789 . . . . . . . . 9 (𝑣 = 𝑥 → ⟨“𝐶𝑧𝑣”⟩ = ⟨“𝐶𝑧𝑥”⟩)
6867eleq1d 2813 . . . . . . . 8 (𝑣 = 𝑥 → (⟨“𝐶𝑧𝑣”⟩ ∈ (∟G‘𝐺) ↔ ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺)))
6963, 68rspc2va 3591 . . . . . . 7 (((𝐶 ∈ (𝐶𝐿𝑧) ∧ 𝑥𝐴) ∧ ∀𝑢 ∈ (𝐶𝐿𝑧)∀𝑣𝐴 ⟨“𝑢𝑧𝑣”⟩ ∈ (∟G‘𝐺)) → ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺))
7052, 53, 60, 69syl21anc 837 . . . . . 6 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → ⟨“𝐶𝑧𝑥”⟩ ∈ (∟G‘𝐺))
711, 2, 3, 4, 10, 11, 12, 17, 20, 47, 70ragflat 28667 . . . . 5 (((𝜑 ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴)) → 𝑥 = 𝑧)
7271ex 412 . . . 4 ((𝜑 ∧ (𝑥𝐴𝑧𝐴)) → (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
7372ralrimivva 3172 . . 3 (𝜑 → ∀𝑥𝐴𝑧𝐴 (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
74 oveq2 7361 . . . . 5 (𝑥 = 𝑧 → (𝐶𝐿𝑥) = (𝐶𝐿𝑧))
7574breq1d 5105 . . . 4 (𝑥 = 𝑧 → ((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴))
7675rmo4 3692 . . 3 (∃*𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ↔ ∀𝑥𝐴𝑧𝐴 (((𝐶𝐿𝑥)(⟂G‘𝐺)𝐴 ∧ (𝐶𝐿𝑧)(⟂G‘𝐺)𝐴) → 𝑥 = 𝑧))
7773, 76sylibr 234 . 2 (𝜑 → ∃*𝑥𝐴 (𝐶𝐿𝑥)(⟂G‘𝐺)𝐴)
78 reu5 3347 . 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 3343  ∃*wrmo 3344   class class class wbr 5095  ran crn 5624  cfv 6486  (class class class)co 7353  ⟨“cs3 14767  Basecbs 17138  distcds 17188  TarskiGcstrkg 28390  Itvcitv 28396  LineGclng 28397  pInvGcmir 28615  ∟Gcrag 28656  ⟂Gcperpg 28658
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 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105
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 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-oadd 8399  df-er 8632  df-map 8762  df-pm 8763  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-dju 9816  df-card 9854  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11367  df-neg 11368  df-nn 12147  df-2 12209  df-3 12210  df-n0 12403  df-xnn0 12476  df-z 12490  df-uz 12754  df-fz 13429  df-fzo 13576  df-hash 14256  df-word 14439  df-concat 14496  df-s1 14521  df-s2 14773  df-s3 14774  df-trkgc 28411  df-trkgb 28412  df-trkgcb 28413  df-trkg 28416  df-cgrg 28474  df-leg 28546  df-mir 28616  df-rag 28657  df-perpg 28659
This theorem is referenced by:  footeq  28687  mideulem2  28697  lmieu  28747
  Copyright terms: Public domain W3C validator