Theorem ragperp 25412

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 2610	. . . 4 ⊢ (pInvG‘𝐺) = (pInvG‘𝐺)
6		isperp.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐺 ∈ TarskiG)
8		ragperp.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿)
9	8	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐵 ∈ ran 𝐿)
10		simprr 792	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑣 ∈ 𝐵)
11	1, 4, 3, 7, 9, 10	tglnpt 25244	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑣 ∈ 𝑃)
12		isperp.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
13	12	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝐴 ∈ ran 𝐿)
14		inss1 3795	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
15		ragperp.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ (𝐴 ∩ 𝐵))
16	14, 15	sseldi 3566	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
17	16	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑋 ∈ 𝐴)
18	1, 4, 3, 7, 13, 17	tglnpt 25244	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑋 ∈ 𝑃)
19		simprl 790	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑢 ∈ 𝐴)
20	1, 4, 3, 7, 13, 19	tglnpt 25244	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑢 ∈ 𝑃)
21		ragperp.v	. . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ 𝐵)
22	21	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ∈ 𝐵)
23	1, 4, 3, 7, 9, 22	tglnpt 25244	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ∈ 𝑃)
24		ragperp.u	. . . . . . . . 9 ⊢ (𝜑 → 𝑈 ∈ 𝐴)
25	24	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ∈ 𝐴)
26	1, 4, 3, 7, 13, 25	tglnpt 25244	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ∈ 𝑃)
27		ragperp.r	. . . . . . . 8 ⊢ (𝜑 → ⟨“𝑈𝑋𝑉”⟩ ∈ (∟G‘𝐺))
28	27	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑈𝑋𝑉”⟩ ∈ (∟G‘𝐺))
29		ragperp.1	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ≠ 𝑋)
30	29	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑈 ≠ 𝑋)
31	24	ad2antrr 758	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑈 ∈ 𝐴)
32	6	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐺 ∈ TarskiG)
33	18	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ∈ 𝑃)
34	20	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑢 ∈ 𝑃)
35		simpr 476	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → ¬ 𝑋 = 𝑢)
36	35	neqned 2789	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ≠ 𝑢)
37	12	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐴 ∈ ran 𝐿)
38	16	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑋 ∈ 𝐴)
39	19	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑢 ∈ 𝐴)
40	1, 3, 4, 32, 33, 34, 36, 36, 37, 38, 39	tglinethru 25331	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝐴 = (𝑋𝐿𝑢))
41	31, 40	eleqtrd 2690	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑢) → 𝑈 ∈ (𝑋𝐿𝑢))
42	41	ex 449	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (¬ 𝑋 = 𝑢 → 𝑈 ∈ (𝑋𝐿𝑢)))
43	42	orrd 392	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑋 = 𝑢 ∨ 𝑈 ∈ (𝑋𝐿𝑢)))
44	43	orcomd 402	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑈 ∈ (𝑋𝐿𝑢) ∨ 𝑋 = 𝑢))
45	1, 2, 3, 4, 5, 7, 26, 18, 23, 20, 28, 30, 44	ragcol 25394	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑢𝑋𝑉”⟩ ∈ (∟G‘𝐺))
46	1, 2, 3, 4, 5, 7, 20, 18, 23, 45	ragcom 25393	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑉𝑋𝑢”⟩ ∈ (∟G‘𝐺))
47		ragperp.2	. . . . . 6 ⊢ (𝜑 → 𝑉 ≠ 𝑋)
48	47	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → 𝑉 ≠ 𝑋)
49	21	ad2antrr 758	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑉 ∈ 𝐵)
50	6	ad2antrr 758	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐺 ∈ TarskiG)
51	18	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ∈ 𝑃)
52	11	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑣 ∈ 𝑃)
53		simpr 476	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → ¬ 𝑋 = 𝑣)
54	53	neqned 2789	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ≠ 𝑣)
55	8	ad2antrr 758	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐵 ∈ ran 𝐿)
56		inss2 3796	. . . . . . . . . . . 12 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
57	56, 15	sseldi 3566	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
58	57	ad2antrr 758	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑋 ∈ 𝐵)
59	10	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑣 ∈ 𝐵)
60	1, 3, 4, 50, 51, 52, 54, 54, 55, 58, 59	tglinethru 25331	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝐵 = (𝑋𝐿𝑣))
61	49, 60	eleqtrd 2690	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) ∧ ¬ 𝑋 = 𝑣) → 𝑉 ∈ (𝑋𝐿𝑣))
62	61	ex 449	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (¬ 𝑋 = 𝑣 → 𝑉 ∈ (𝑋𝐿𝑣)))
63	62	orrd 392	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑋 = 𝑣 ∨ 𝑉 ∈ (𝑋𝐿𝑣)))
64	63	orcomd 402	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → (𝑉 ∈ (𝑋𝐿𝑣) ∨ 𝑋 = 𝑣))
65	1, 2, 3, 4, 5, 7, 23, 18, 20, 11, 46, 48, 64	ragcol 25394	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑣𝑋𝑢”⟩ ∈ (∟G‘𝐺))
66	1, 2, 3, 4, 5, 7, 11, 18, 20, 65	ragcom 25393	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵)) → ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺))
67	66	ralrimivva 2954	. 2 ⊢ (𝜑 → ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺))
68	1, 2, 3, 4, 6, 12, 8, 15	isperp2 25410	. 2 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑋𝑣”⟩ ∈ (∟G‘𝐺)))
69	67, 68	mpbird 246	1 ⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896   ∩ cin 3539   class class class wbr 4583  ran crn 5039  ‘cfv 5804  (class class class)co 6549  ⟨“cs3 13438  Basecbs 15695  distcds 15777  TarskiGcstrkg 25129  Itvcitv 25135  LineGclng 25136  pInvGcmir 25347  ∟Gcrag 25388  ⟂Gcperpg 25390

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-concat 13156  df-s1 13157  df-s2 13444  df-s3 13445  df-trkgc 25147  df-trkgb 25148  df-trkgcb 25149  df-trkg 25152  df-cgrg 25206  df-mir 25348  df-rag 25389  df-perpg 25391

This theorem is referenced by:  footex  25413  colperpexlem3  25424  mideulem2  25426  lmimid  25486  hypcgrlem1  25491  hypcgrlem2  25492  trgcopyeulem  25497