| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > perprag | Structured version Visualization version GIF version | ||
| Description: Deduce a right angle from perpendicular lines. (Contributed by Thierry Arnoux, 10-Nov-2019.) |
| Ref | Expression |
|---|---|
| colperpex.p | ⊢ 𝑃 = (Base‘𝐺) |
| colperpex.d | ⊢ − = (dist‘𝐺) |
| colperpex.i | ⊢ 𝐼 = (Itv‘𝐺) |
| colperpex.l | ⊢ 𝐿 = (LineG‘𝐺) |
| colperpex.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| perprag.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| perprag.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| perprag.3 | ⊢ (𝜑 → 𝐶 ∈ (𝐴𝐿𝐵)) |
| perprag.4 | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| perprag.5 | ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐶𝐿𝐷)) |
| Ref | Expression |
|---|---|
| perprag | ⊢ (𝜑 → 〈“𝐴𝐶𝐷”〉 ∈ (∟G‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqidd 2764 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐴 = 𝐴) | |
| 2 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐶 = 𝐷) | |
| 3 | eqidd 2764 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 𝐷 = 𝐷) | |
| 4 | 1, 2, 3 | s3eqd 14903 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 〈“𝐴𝐶𝐷”〉 = 〈“𝐴𝐷𝐷”〉) |
| 5 | colperpex.p | . . . . 5 ⊢ 𝑃 = (Base‘𝐺) | |
| 6 | colperpex.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
| 7 | colperpex.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
| 8 | colperpex.l | . . . . 5 ⊢ 𝐿 = (LineG‘𝐺) | |
| 9 | eqid 2763 | . . . . 5 ⊢ (pInvG‘𝐺) = (pInvG‘𝐺) | |
| 10 | colperpex.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 11 | perprag.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 12 | perprag.4 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 13 | 5, 6, 7, 8, 9, 10, 11, 12, 12 | ragtrivb 28960 | . . . 4 ⊢ (𝜑 → 〈“𝐴𝐷𝐷”〉 ∈ (∟G‘𝐺)) |
| 14 | 13 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 〈“𝐴𝐷𝐷”〉 ∈ (∟G‘𝐺)) |
| 15 | 4, 14 | eqeltrd 2863 | . 2 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → 〈“𝐴𝐶𝐷”〉 ∈ (∟G‘𝐺)) |
| 16 | 10 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐺 ∈ TarskiG) |
| 17 | perprag.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 18 | perprag.3 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ (𝐴𝐿𝐵)) | |
| 19 | 5, 8, 7, 10, 11, 17, 18 | tglngne 28797 | . . . . 5 ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| 20 | 5, 7, 8, 10, 11, 17, 19 | tgelrnln 28881 | . . . 4 ⊢ (𝜑 → (𝐴𝐿𝐵) ∈ ran 𝐿) |
| 21 | 20 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → (𝐴𝐿𝐵) ∈ ran 𝐿) |
| 22 | 5, 8, 7, 10, 20, 18 | tglnpt 28796 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| 23 | 22 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐶 ∈ 𝑃) |
| 24 | 12 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐷 ∈ 𝑃) |
| 25 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐶 ≠ 𝐷) | |
| 26 | 5, 7, 8, 16, 23, 24, 25 | tgelrnln 28881 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → (𝐶𝐿𝐷) ∈ ran 𝐿) |
| 27 | 18 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐶 ∈ (𝐴𝐿𝐵)) |
| 28 | 5, 7, 8, 16, 23, 24, 25 | tglinerflx1 28884 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐶 ∈ (𝐶𝐿𝐷)) |
| 29 | 27, 28 | elind 4154 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐶 ∈ ((𝐴𝐿𝐵) ∩ (𝐶𝐿𝐷))) |
| 30 | 5, 7, 8, 10, 11, 17, 19 | tglinerflx1 28884 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐴𝐿𝐵)) |
| 31 | 30 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐴 ∈ (𝐴𝐿𝐵)) |
| 32 | 5, 7, 8, 16, 23, 24, 25 | tglinerflx2 28885 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 𝐷 ∈ (𝐶𝐿𝐷)) |
| 33 | perprag.5 | . . . 4 ⊢ (𝜑 → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐶𝐿𝐷)) | |
| 34 | 33 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → (𝐴𝐿𝐵)(⟂G‘𝐺)(𝐶𝐿𝐷)) |
| 35 | 5, 6, 7, 8, 16, 21, 26, 29, 31, 32, 34 | isperp2d 28974 | . 2 ⊢ ((𝜑 ∧ 𝐶 ≠ 𝐷) → 〈“𝐴𝐶𝐷”〉 ∈ (∟G‘𝐺)) |
| 36 | 15, 35 | pm2.61dane 3045 | 1 ⊢ (𝜑 → 〈“𝐴𝐶𝐷”〉 ∈ (∟G‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 class class class wbr 5110 ran crn 5664 ‘cfv 6538 (class class class)co 7412 〈“cs3 14881 Basecbs 17270 distcds 17320 TarskiGcstrkg 28674 Itvcitv 28680 LineGclng 28681 pInvGcmir 28907 ∟Gcrag 28951 ⟂Gcperpg 28953 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-oadd 8458 df-er 8695 df-map 8827 df-pm 8828 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-dju 9888 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-xnn0 12579 df-z 12593 df-uz 12864 df-fz 13537 df-fzo 13685 df-hash 14369 df-word 14553 df-concat 14610 df-s1 14636 df-s2 14887 df-s3 14888 df-trkgc 28695 df-trkgb 28696 df-trkgcb 28697 df-trkg 28700 df-cgrg 28758 df-mir 28908 df-rag 28952 df-perpg 28954 |
| This theorem is referenced by: perpdragALT 28986 perpdrag 28987 colperpexlem3 28991 mideulem2 28993 opphllem 28994 opphllem5 29010 opphllem6 29011 trgcopy 29093 perpeqlem 29128 prlngmid2 29189 |
| Copyright terms: Public domain | W3C validator |