![]() |
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 2741 | . . . . . . . . 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 731 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐺 ∈ TarskiG) |
7 | isperp.a | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿) | |
8 | 7 | ad4antr 731 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ∈ ran 𝐿) |
9 | isperp2.b | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿) | |
10 | 9 | ad4antr 731 | . . . . . . . . . 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 28740 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝐴 ≠ 𝐵) |
14 | simpllr 775 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 ∈ (𝐴 ∩ 𝐵)) | |
15 | isperp2.x | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵)) | |
16 | 15 | ad4antr 731 | . . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑋 ∈ (𝐴 ∩ 𝐵)) |
17 | 2, 3, 4, 6, 8, 10, 13, 14, 16 | tglineineq 28669 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑥 = 𝑋) |
18 | eqidd 2741 | . . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 𝑣 = 𝑣) | |
19 | 1, 17, 18 | s3eqd 14913 | . . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) |
20 | 19 | eleq1d 2829 | . . . . . . 7 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
21 | 20 | biimpd 229 | . . . . . 6 ⊢ (((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) ∧ 𝑣 ∈ 𝐵) → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
22 | 21 | ralimdva 3173 | . . . . 5 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ 𝑢 ∈ 𝐴) → (∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
23 | 22 | ralimdva 3173 | . . . 4 ⊢ (((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
24 | 23 | imp 406 | . . 3 ⊢ ((((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) ∧ 𝑥 ∈ (𝐴 ∩ 𝐵)) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
25 | 2, 11, 3, 4, 5, 7, 9 | isperp 28738 | . . . 4 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺))) |
26 | 25 | biimpa 476 | . . 3 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
27 | 24, 26 | r19.29a 3168 | . 2 ⊢ ((𝜑 ∧ 𝐴(⟂G‘𝐺)𝐵) → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) |
28 | s3eq2 14919 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → 〈“𝑢𝑥𝑣”〉 = 〈“𝑢𝑋𝑣”〉) | |
29 | 28 | eleq1d 2829 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
30 | 29 | 2ralbidv 3227 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺))) |
31 | 30 | rspcev 3635 | . . . 4 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑋𝑣”〉 ∈ (∟G‘𝐺)) → ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 〈“𝑢𝑥𝑣”〉 ∈ (∟G‘𝐺)) |
32 | 15, 31 | sylan 579 | . . 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 1537 ∈ wcel 2108 ∀wral 3067 ∃wrex 3076 ∩ cin 3975 class class class wbr 5166 ran crn 5701 ‘cfv 6573 〈“cs3 14891 Basecbs 17258 distcds 17320 TarskiGcstrkg 28453 Itvcitv 28459 LineGclng 28460 ∟Gcrag 28719 ⟂Gcperpg 28721 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-oadd 8526 df-er 8763 df-map 8886 df-pm 8887 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-dju 9970 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-n0 12554 df-xnn0 12626 df-z 12640 df-uz 12904 df-fz 13568 df-fzo 13712 df-hash 14380 df-word 14563 df-concat 14619 df-s1 14644 df-s2 14897 df-s3 14898 df-trkgc 28474 df-trkgb 28475 df-trkgcb 28476 df-trkg 28479 df-cgrg 28537 df-mir 28679 df-rag 28720 df-perpg 28722 |
This theorem is referenced by: isperp2d 28742 ragperp 28743 foot 28748 |
Copyright terms: Public domain | W3C validator |