Theorem isperp 29217

Description: Property for 2 lines A, B to be perpendicular. Item (ii) of definition 8.11 of [Schwabhauser] p. 59. (Contributed by Thierry Arnoux, 16-Oct-2019.)

Hypotheses

Ref	Expression
isperp.p	⊢ 𝑃 = (Base‘𝐺)
isperp.d	⊢ − = (dist‘𝐺)
isperp.i	⊢ 𝐼 = (Itv‘𝐺)
isperp.l	⊢ 𝐿 = (LineG‘𝐺)
isperp.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
isperp.a	⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
isperp.b	⊢ (𝜑 → 𝐵 ∈ ran 𝐿)

Assertion

Ref	Expression
isperp	⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))

Distinct variable groups:   𝑣,𝑢,𝑥,𝐴   𝑢,𝐵,𝑣,𝑥   𝑢,𝐺,𝑣,𝑥   𝜑,𝑢,𝑣,𝑥

Allowed substitution hints:   𝑃(𝑥, 𝑣, 𝑢)   𝐼(𝑥, 𝑣, 𝑢)   𝐿(𝑥, 𝑣, 𝑢)   − (𝑥, 𝑣, 𝑢)

Proof of Theorem isperp

Dummy variables 𝑎 𝑏 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-br 5107	. . 3 ⊢ (𝐴(⟂G‘𝐺)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (⟂G‘𝐺))
2		df-perpg 29201	. . . . 5 ⊢ ⟂G = (𝑔 ∈ V ↦ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))})
3		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
4	3	fveq2d 6912	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = (LineG‘𝐺))
5		isperp.l	. . . . . . . . . . 11 ⊢ 𝐿 = (LineG‘𝐺)
6	4, 5	eqtr4di 2816	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = 𝐿)
7	6	rneqd 5927	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ran (LineG‘𝑔) = ran 𝐿)
8	7	eleq2d 2850	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑎 ∈ ran (LineG‘𝑔) ↔ 𝑎 ∈ ran 𝐿))
9	7	eleq2d 2850	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑏 ∈ ran (LineG‘𝑔) ↔ 𝑏 ∈ ran 𝐿))
10	8, 9	anbi12d 644	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ↔ (𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿)))
11	3	fveq2d 6912	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∟G‘𝑔) = (∟G‘𝐺))
12	11	eleq2d 2850	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
13	12	ralbidv 3189	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
14	13	rexralbidv 3232	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
15	10, 14	anbi12d 644	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔)) ↔ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))))
16	15	opabbidv 5174	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
17		isperp.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
18	17	elexd 3477	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ V)
19	5	fvexi 6922	. . . . . . . 8 ⊢ 𝐿 ∈ V
20		rnexg 7938	. . . . . . . 8 ⊢ (𝐿 ∈ V → ran 𝐿 ∈ V)
21	19, 20	mp1i 14	. . . . . . 7 ⊢ (𝜑 → ran 𝐿 ∈ V)
22	21, 21	xpexd 7789	. . . . . 6 ⊢ (𝜑 → (ran 𝐿 × ran 𝐿) ∈ V)
23		opabssxp 5748	. . . . . . 7 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿)
24	23	a1i 11	. . . . . 6 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿))
25	22, 24	ssexd 5290	. . . . 5 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ∈ V)
26	2, 16, 18, 25	fvmptd2 7025	. . . 4 ⊢ (𝜑 → (⟂G‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
27	26	eleq2d 2850	. . 3 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ (⟂G‘𝐺) ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}))
28	1, 27	bitrid 286	. 2 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}))
29		isperp.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
30		isperp.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿)
31		ineq12 4115	. . . . 5 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎 ∩ 𝑏) = (𝐴 ∩ 𝐵))
32		simpll 779	. . . . . 6 ⊢ (((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ (𝑎 ∩ 𝑏)) → 𝑎 = 𝐴)
33		simpllr 788	. . . . . . 7 ⊢ ((((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ (𝑎 ∩ 𝑏)) ∧ 𝑢 ∈ 𝑎) → 𝑏 = 𝐵)
34	33	raleqdv 3323	. . . . . 6 ⊢ ((((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ (𝑎 ∩ 𝑏)) ∧ 𝑢 ∈ 𝑎) → (∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
35	32, 34	raleqbidva 3329	. . . . 5 ⊢ (((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∧ 𝑥 ∈ (𝑎 ∩ 𝑏)) → (∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
36	31, 35	rexeqbidva 3330	. . . 4 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
37	36	opelopab2a 5513	. . 3 ⊢ ((𝐴 ∈ ran 𝐿 ∧ 𝐵 ∈ ran 𝐿) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
38	29, 30, 37	syl2anc 596	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
39	28, 38	bitrd 282	1 ⊢ (𝜑 → (𝐴(⟂G‘𝐺)𝐵 ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)∀𝑢 ∈ 𝐴 ∀𝑣 ∈ 𝐵 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ⟨cop 4838   class class class wbr 5106  {copab 5170   × cxp 5653  ran crn 5656  ‘cfv 6558  ⟨“cs3 15021  Basecbs 17416  distcds 17466  TarskiGcstrkg 28919  Itvcitv 28925  LineGclng 28926  ∟Gcrag 29198  ⟂Gcperpg 29200

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6512  df-fun 6560  df-fv 6566  df-perpg 29201

This theorem is used by:  perpcom  29218  perpneq  29219  isperp2  29220  perpin  29230