![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > perpdrag | Structured version Visualization version GIF version |
Description: Deduce a right angle from perpendicular lines. (Contributed by Thierry Arnoux, 12-Dec-2019.) |
Ref | Expression |
---|---|
colperpex.p | ⊢ 𝑃 = (Base‘𝐺) |
colperpex.d | ⊢ − = (dist‘𝐺) |
colperpex.i | ⊢ 𝐼 = (Itv‘𝐺) |
colperpex.l | ⊢ 𝐿 = (LineG‘𝐺) |
colperpex.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
perpdrag.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
perpdrag.2 | ⊢ (𝜑 → 𝐵 ∈ 𝐷) |
perpdrag.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
perpdrag.4 | ⊢ (𝜑 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐶)) |
Ref | Expression |
---|---|
perpdrag | ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | colperpex.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
2 | colperpex.d | . . 3 ⊢ − = (dist‘𝐺) | |
3 | colperpex.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | colperpex.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
5 | colperpex.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
6 | 5 | ad2antrr 724 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐺 ∈ TarskiG) |
7 | perpdrag.4 | . . . . . 6 ⊢ (𝜑 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐶)) | |
8 | 7 | ad2antrr 724 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐶)) |
9 | 4, 6, 8 | perpln1 28586 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐷 ∈ ran 𝐿) |
10 | perpdrag.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
11 | 10 | ad2antrr 724 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ∈ 𝐷) |
12 | 1, 4, 3, 6, 9, 11 | tglnpt 28425 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ∈ 𝑃) |
13 | simplr 767 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝑥 ∈ 𝐷) | |
14 | 1, 4, 3, 6, 9, 13 | tglnpt 28425 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝑥 ∈ 𝑃) |
15 | perpdrag.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
16 | 15 | ad2antrr 724 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐵 ∈ 𝐷) |
17 | simpr 483 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐴 ≠ 𝑥) | |
18 | 1, 3, 4, 6, 12, 14, 17, 17, 9, 11, 13 | tglinethru 28512 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐷 = (𝐴𝐿𝑥)) |
19 | 16, 18 | eleqtrd 2827 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐵 ∈ (𝐴𝐿𝑥)) |
20 | perpdrag.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
21 | 20 | ad2antrr 724 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 𝐶 ∈ 𝑃) |
22 | 18, 8 | eqbrtrrd 5173 | . . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → (𝐴𝐿𝑥)(⟂G‘𝐺)(𝐵𝐿𝐶)) |
23 | 1, 2, 3, 4, 6, 12, 14, 19, 21, 22 | perprag 28602 | . 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝐴 ≠ 𝑥) → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
24 | 4, 5, 7 | perpln1 28586 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) |
25 | 1, 3, 4, 5, 24, 10 | tglnpt2 28517 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐷 𝐴 ≠ 𝑥) |
26 | 23, 25 | r19.29a 3151 | 1 ⊢ (𝜑 → 〈“𝐴𝐵𝐶”〉 ∈ (∟G‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2929 class class class wbr 5149 ‘cfv 6549 (class class class)co 7419 〈“cs3 14829 Basecbs 17183 distcds 17245 TarskiGcstrkg 28303 Itvcitv 28309 LineGclng 28310 ∟Gcrag 28569 ⟂Gcperpg 28571 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4910 df-int 4951 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-oadd 8491 df-er 8725 df-map 8847 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-dju 9926 df-card 9964 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-nn 12246 df-2 12308 df-3 12309 df-n0 12506 df-xnn0 12578 df-z 12592 df-uz 12856 df-fz 13520 df-fzo 13663 df-hash 14326 df-word 14501 df-concat 14557 df-s1 14582 df-s2 14835 df-s3 14836 df-trkgc 28324 df-trkgb 28325 df-trkgcb 28326 df-trkg 28329 df-cgrg 28387 df-mir 28529 df-rag 28570 df-perpg 28572 |
This theorem is referenced by: lmiisolem 28672 |
Copyright terms: Public domain | W3C validator |