| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isperp2 | Structured version Visualization version GIF version | ||
| Description: Property for 2 lines A, B, intersecting at a point X to be perpendicular. Item (i) of definition 8.13 of [Schwabhauser] p. 59. (Contributed by Thierry Arnoux, 16-Oct-2019.) |
| Ref | Expression |
|---|---|
| isperp.p | ⊢ 𝑃 = (Base‘𝐺) |
| isperp.d | ⊢ − = (dist‘𝐺) |
| isperp.i | ⊢ 𝐼 = (Itv‘𝐺) |
| isperp.l | ⊢ 𝐿 = (LineG‘𝐺) |
| isperp.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| isperp.a | ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) |
| isperp2.b | ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) |
| isperp2.x | ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
| Ref | Expression |
|---|---|
| isperp2 | ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqidd 2737 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑢 = 𝑢) | |
| 2 | isperp.p | . . . . . . . . . 10 ⊢ 𝑃 = (Base‘𝐺) | |
| 3 | isperp.i | . . . . . . . . . 10 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | isperp.l | . . . . . . . . . 10 ⊢ 𝐿 = (LineG‘𝐺) | |
| 5 | isperp.g | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | 5 | ad4antr 732 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐺 ∈ TarskiG) |
| 7 | isperp.a | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
| 8 | 7 | ad4antr 732 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ∈ ran 𝐿) |
| 9 | isperp2.b | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) | |
| 10 | 9 | ad4antr 732 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐵 ∈ ran 𝐿) |
| 11 | isperp.d | . . . . . . . . . . 11 ⊢ − = (dist‘𝐺) | |
| 12 | simp-4r 783 | . . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴(⟂G‘𝐺)𝐵) | |
| 13 | 2, 11, 3, 4, 6, 8, 10, 12 | perpneq 28698 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ≠ 𝐵) |
| 14 | simpllr 775 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 ∈ (𝐴 ∩ 𝐵)) | |
| 15 | isperp2.x | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) | |
| 16 | 15 | ad4antr 732 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
| 17 | 2, 3, 4, 6, 8, 10, 13, 14, 16 | tglineineq 28627 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 = 𝑋) |
| 18 | eqidd 2737 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑣 = 𝑣) | |
| 19 | 1, 17, 18 | s3eqd 14888 | . . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) |
| 20 | 19 | eleq1d 2820 | . . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 21 | 20 | biimpd 229 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 22 | 21 | ralimdva 3153 | . . . . 5 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) → (∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 23 | 22 | ralimdva 3153 | . . . 4 ⊢ (((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 24 | 23 | imp 406 | . . 3 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
| 25 | 2, 11, 3, 4, 5, 7, 9 | isperp 28696 | . . . 4 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺))) |
| 26 | 25 | biimpa 476 | . . 3 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
| 27 | 24, 26 | r19.29a 3149 | . 2 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
| 28 | s3eq2 14894 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) | |
| 29 | 28 | eleq1d 2820 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 30 | 29 | 2ralbidv 3209 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| 31 | 30 | rspcev 3606 | . . . 4 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
| 32 | 15, 31 | sylan 580 | . . 3 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
| 33 | 25 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺))) |
| 34 | 32, 33 | mpbird 257 | . 2 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → 𝐴(⟂G‘𝐺)𝐵) |
| 35 | 27, 34 | impbida 800 | 1 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3052 ∃wrex 3061 ∩ cin 3930 class class class wbr 5124 ran crn 5660 ‘cfv 6536 〈“cs3 14866 Basecbs 17233 distcds 17285 TarskiGcstrkg 28411 Itvcitv 28417 LineGclng 28418 ∟Gcrag 28677 ⟂Gcperpg 28679 |
| 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 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| 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 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-oadd 8489 df-er 8724 df-map 8847 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-dju 9920 df-card 9958 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-2 12308 df-3 12309 df-n0 12507 df-xnn0 12580 df-z 12594 df-uz 12858 df-fz 13530 df-fzo 13677 df-hash 14354 df-word 14537 df-concat 14594 df-s1 14619 df-s2 14872 df-s3 14873 df-trkgc 28432 df-trkgb 28433 df-trkgcb 28434 df-trkg 28437 df-cgrg 28495 df-mir 28637 df-rag 28678 df-perpg 28680 |
| This theorem is referenced by: isperp2d 28700 ragperp 28701 foot 28706 |
| Copyright terms: Public domain | W3C validator |