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 2822 | . . . . . . . . 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 730 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐺 ∈ TarskiG) |
7 | isperp.a | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
8 | 7 | ad4antr 730 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ∈ ran 𝐿) |
9 | isperp2.b | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) | |
10 | 9 | ad4antr 730 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐵 ∈ ran 𝐿) |
11 | isperp.d | . . . . . . . . . . 11 ⊢ − = (dist‘𝐺) | |
12 | simp-4r 782 | . . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴(⟂G‘𝐺)𝐵) | |
13 | 2, 11, 3, 4, 6, 8, 10, 12 | perpneq 26494 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ≠ 𝐵) |
14 | simpllr 774 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 ∈ (𝐴 ∩ 𝐵)) | |
15 | isperp2.x | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) | |
16 | 15 | ad4antr 730 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
17 | 2, 3, 4, 6, 8, 10, 13, 14, 16 | tglineineq 26423 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 = 𝑋) |
18 | eqidd 2822 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑣 = 𝑣) | |
19 | 1, 17, 18 | s3eqd 14220 | . . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) |
20 | 19 | eleq1d 2897 | . . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
21 | 20 | biimpd 231 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
22 | 21 | ralimdva 3177 | . . . . 5 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) → (∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
23 | 22 | ralimdva 3177 | . . . 4 ⊢ (((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
24 | 23 | imp 409 | . . 3 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
25 | 2, 11, 3, 4, 5, 7, 9 | isperp 26492 | . . . 4 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺))) |
26 | 25 | biimpa 479 | . . 3 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
27 | 24, 26 | r19.29a 3289 | . 2 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
28 | s3eq2 14226 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) | |
29 | 28 | eleq1d 2897 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
30 | 29 | 2ralbidv 3199 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
31 | 30 | rspcev 3622 | . . . 4 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
32 | 15, 31 | sylan 582 | . . 3 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
33 | 25 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺))) |
34 | 32, 33 | mpbird 259 | . 2 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → 𝐴(⟂G‘𝐺)𝐵) |
35 | 27, 34 | impbida 799 | 1 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 ∩ cin 3934 class class class wbr 5058 ran crn 5550 ‘cfv 6349 〈“cs3 14198 Basecbs 16477 distcds 16568 TarskiGcstrkg 26210 Itvcitv 26216 LineGclng 26217 ∟Gcrag 26473 ⟂Gcperpg 26475 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-dju 9324 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-fz 12887 df-fzo 13028 df-hash 13685 df-word 13856 df-concat 13917 df-s1 13944 df-s2 14204 df-s3 14205 df-trkgc 26228 df-trkgb 26229 df-trkgcb 26230 df-trkg 26233 df-cgrg 26291 df-mir 26433 df-rag 26474 df-perpg 26476 |
This theorem is referenced by: isperp2d 26496 ragperp 26497 foot 26502 |
Copyright terms: Public domain | W3C validator |