Theorem ragperp 26505

Description: Deduce that two lines are perpendicular from a right angle statement. One direction of theorem 8.13 of [Schwabhauser] p. 59. (Contributed by Thierry Arnoux, 20-Oct-2019.)

Hypotheses

Ref	Expression
isperp.p	⊢ 𝑃 = (Base‘𝐺)
isperp.d	⊢ − = (dist‘𝐺)
isperp.i	⊢ 𝐼 = (Itv‘𝐺)
isperp.l	⊢ 𝐿 = (LineG‘𝐺)
isperp.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
isperp.a	⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
ragperp.b	⊢ (𝜑 → 𝐵 ∈ ran 𝐿)
ragperp.x	⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵))
ragperp.u	⊢ (𝜑 → 𝑈 ∈ 𝐴)
ragperp.v	⊢ (𝜑 → 𝑉 ∈ 𝐵)
ragperp.1	⊢ (𝜑 → 𝑈 ≠ 𝑋)
ragperp.2	⊢ (𝜑 → 𝑉 ≠ 𝑋)
ragperp.r	⊢ (𝜑 → ⟨“𝑈𝑋𝑉”⟩ ∈ (∟G‘𝐺))

Assertion

Ref	Expression
ragperp	⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)

Proof of Theorem ragperp

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isperp.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		isperp.d	. . . 4 ⊢ − = (dist‘𝐺)
3		isperp.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
4		isperp.l	. . . 4 ⊢ 𝐿 = (LineG‘𝐺)
5		eqid 2823	. . . 4 ⊢ (pInvG‘𝐺) = (pInvG‘𝐺)
6		isperp.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7	6	adantr 483	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐺 ∈ TarskiG)
8		ragperp.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿)
9	8	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐵 ∈ ran 𝐿)
10		simprr 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑣 ∈ 𝐵)
11	1, 4, 3, 7, 9, 10	tglnpt 26337	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑣 ∈ 𝑃)
12		isperp.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
13	12	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐴 ∈ ran 𝐿)
14		ragperp.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵))
15	14	elin1d 4177	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
16	15	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑋 ∈ 𝐴)
17	1, 4, 3, 7, 13, 16	tglnpt 26337	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑋 ∈ 𝑃)
18		simprl 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑢 ∈ 𝐴)
19	1, 4, 3, 7, 13, 18	tglnpt 26337	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑢 ∈ 𝑃)
20		ragperp.v	. . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ 𝐵)
21	20	adantr 483	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ∈ 𝐵)
22	1, 4, 3, 7, 9, 21	tglnpt 26337	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ∈ 𝑃)
23		ragperp.u	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝐴)
24	23	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ∈ 𝐴)
25	1, 4, 3, 7, 13, 24	tglnpt 26337	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ∈ 𝑃)
26		ragperp.r	. . . . . . . 8 ⊢ (𝜑 → ⟨“𝑈𝑋𝑉”⟩ ∈ (∟G‘𝐺))
27	26	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑈𝑋𝑉”⟩ ∈ (∟G‘𝐺))
28		ragperp.1	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ≠ 𝑋)
29	28	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ≠ 𝑋)
30	23	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑈 ∈ 𝐴)
31	6	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐺 ∈ TarskiG)
32	17	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ∈ 𝑃)
33	19	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑢 ∈ 𝑃)
34		simpr 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → ¬ 𝑋 = 𝑢)
35	34	neqned 3025	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ≠ 𝑢)
36	12	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐴 ∈ ran 𝐿)
37	15	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ∈ 𝐴)
38	18	adantr 483	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑢 ∈ 𝐴)
39	1, 3, 4, 31, 32, 33, 35, 35, 36, 37, 38	tglinethru 26424	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐴 = (𝑋𝐿𝑢))
40	30, 39	eleqtrd 2917	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑈 ∈ (𝑋𝐿𝑢))
41	40	ex 415	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (¬ 𝑋 = 𝑢 → 𝑈 ∈ (𝑋𝐿𝑢)))
42	41	orrd 859	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑋 = 𝑢 ∨ 𝑈 ∈ (𝑋𝐿𝑢)))
43	42	orcomd 867	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑈 ∈ (𝑋𝐿𝑢) ∨ 𝑋 = 𝑢))
44	1, 2, 3, 4, 5, 7, 25, 17, 22, 19, 27, 29, 43	ragcol 26487	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑢𝑋𝑉”⟩ ∈ (∟G‘𝐺))
45	1, 2, 3, 4, 5, 7, 19, 17, 22, 44	ragcom 26486	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑉𝑋𝑢”⟩ ∈ (∟G‘𝐺))
46		ragperp.2	. . . . . 6 ⊢ (𝜑 → 𝑉 ≠ 𝑋)
47	46	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ≠ 𝑋)
48	20	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑉 ∈ 𝐵)
49	6	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐺 ∈ TarskiG)
50	17	adantr 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ∈ 𝑃)
51	11	adantr 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑣 ∈ 𝑃)
52		simpr 487	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → ¬ 𝑋 = 𝑣)
53	52	neqned 3025	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ≠ 𝑣)
54	8	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐵 ∈ ran 𝐿)
55	14	elin2d 4178	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
56	55	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ∈ 𝐵)
57	10	adantr 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑣 ∈ 𝐵)
58	1, 3, 4, 49, 50, 51, 53, 53, 54, 56, 57	tglinethru 26424	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐵 = (𝑋𝐿𝑣))
59	48, 58	eleqtrd 2917	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑉 ∈ (𝑋𝐿𝑣))
60	59	ex 415	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (¬ 𝑋 = 𝑣 → 𝑉 ∈ (𝑋𝐿𝑣)))
61	60	orrd 859	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑋 = 𝑣 ∨ 𝑉 ∈ (𝑋𝐿𝑣)))
62	61	orcomd 867	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑉 ∈ (𝑋𝐿𝑣) ∨ 𝑋 = 𝑣))
63	1, 2, 3, 4, 5, 7, 22, 17, 19, 11, 45, 47, 62	ragcol 26487	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑣𝑋𝑢”⟩ ∈ (∟G‘𝐺))
64	1, 2, 3, 4, 5, 7, 11, 17, 19, 63	ragcom 26486	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺))
65	64	ralrimivva 3193	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺))
66	1, 2, 3, 4, 6, 12, 8, 14	isperp2 26503	. 2 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺)))
67	65, 66	mpbird 259	1 ⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ≠ wne 3018  ∀wral 3140   ∩ cin 3937   class class class wbr 5068  ran crn 5558  ‘cfv 6357  (class class class)co 7158  ⟨“cs3 14206  Basecbs 16485  distcds 16576  TarskiGcstrkg 26218  Itvcitv 26224  LineGclng 26225  pInvGcmir 26440  ∟Gcrag 26481  ⟂Gcperpg 26483

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-dju 9332  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-n0 11901  df-xnn0 11971  df-z 11985  df-uz 12247  df-fz 12896  df-fzo 13037  df-hash 13694  df-word 13865  df-concat 13925  df-s1 13952  df-s2 14212  df-s3 14213  df-trkgc 26236  df-trkgb 26237  df-trkgcb 26238  df-trkg 26241  df-cgrg 26299  df-mir 26441  df-rag 26482  df-perpg 26484

This theorem is referenced by:  footexALT  26506  footexlem2  26508  colperpexlem3  26520  mideulem2  26522  lmimid  26582  hypcgrlem1  26587  hypcgrlem2  26588  trgcopyeulem  26593