Theorem perpln1 26975

Description: Derive a line from perpendicularity. (Contributed by Thierry Arnoux, 27-Nov-2019.)

Hypotheses

Ref	Expression
perpln.l	⊢ 𝐿 = (LineG‘𝐺)
perpln.1	⊢ (𝜑 → 𝐺 ∈ TarskiG)
perpln.2	⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)

Assertion

Ref	Expression
perpln1	⊢ (𝜑 → 𝐴 ∈ ran 𝐿)

Proof of Theorem perpln1

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

Step	Hyp	Ref	Expression
1		df-perpg 26961	. . . . . 6 ⊢ ⟂G = (𝑔 ∈ V ↦ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))})
2		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
3	2	fveq2d 6760	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = (LineG‘𝐺))
4		perpln.l	. . . . . . . . . . . 12 ⊢ 𝐿 = (LineG‘𝐺)
5	3, 4	eqtr4di 2797	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = 𝐿)
6	5	rneqd 5836	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ran (LineG‘𝑔) = ran 𝐿)
7	6	eleq2d 2824	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑎 ∈ ran (LineG‘𝑔) ↔ 𝑎 ∈ ran 𝐿))
8	6	eleq2d 2824	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑏 ∈ ran (LineG‘𝑔) ↔ 𝑏 ∈ ran 𝐿))
9	7, 8	anbi12d 630	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ↔ (𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿)))
10	2	fveq2d 6760	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∟G‘𝑔) = (∟G‘𝐺))
11	10	eleq2d 2824	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
12	11	ralbidv 3120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
13	12	rexralbidv 3229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
14	9, 13	anbi12d 630	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔)) ↔ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))))
15	14	opabbidv 5136	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
16		perpln.1	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
17	16	elexd 3442	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ V)
18	4	fvexi 6770	. . . . . . . . 9 ⊢ 𝐿 ∈ V
19		rnexg 7725	. . . . . . . . 9 ⊢ (𝐿 ∈ V → ran 𝐿 ∈ V)
20	18, 19	mp1i 13	. . . . . . . 8 ⊢ (𝜑 → ran 𝐿 ∈ V)
21	20, 20	xpexd 7579	. . . . . . 7 ⊢ (𝜑 → (ran 𝐿 × ran 𝐿) ∈ V)
22		opabssxp 5669	. . . . . . . 8 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿)
23	22	a1i 11	. . . . . . 7 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿))
24	21, 23	ssexd 5243	. . . . . 6 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ∈ V)
25	1, 15, 17, 24	fvmptd2 6865	. . . . 5 ⊢ (𝜑 → (⟂G‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
26		anass 468	. . . . . 6 ⊢ (((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)) ↔ (𝑎 ∈ ran 𝐿 ∧ (𝑏 ∈ ran 𝐿 ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))))
27	26	opabbii 5137	. . . . 5 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ran 𝐿 ∧ (𝑏 ∈ ran 𝐿 ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))}
28	25, 27	eqtrdi 2795	. . . 4 ⊢ (𝜑 → (⟂G‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ran 𝐿 ∧ (𝑏 ∈ ran 𝐿 ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))})
29	28	dmeqd 5803	. . 3 ⊢ (𝜑 → dom (⟂G‘𝐺) = dom {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ran 𝐿 ∧ (𝑏 ∈ ran 𝐿 ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))})
30		dmopabss 5816	. . 3 ⊢ dom {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ ran 𝐿 ∧ (𝑏 ∈ ran 𝐿 ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))} ⊆ ran 𝐿
31	29, 30	eqsstrdi 3971	. 2 ⊢ (𝜑 → dom (⟂G‘𝐺) ⊆ ran 𝐿)
32		relopabv 5720	. . . . . 6 ⊢ Rel {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}
33	25	releqd 5679	. . . . . 6 ⊢ (𝜑 → (Rel (⟂G‘𝐺) ↔ Rel {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}))
34	32, 33	mpbiri 257	. . . . 5 ⊢ (𝜑 → Rel (⟂G‘𝐺))
35		perpln.2	. . . . 5 ⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)
36		brrelex12 5630	. . . . 5 ⊢ ((Rel (⟂G‘𝐺) ∧ 𝐴(⟂G‘𝐺)𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
37	34, 35, 36	syl2anc 583	. . . 4 ⊢ (𝜑 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
38	37	simpld 494	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
39	37	simprd 495	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
40		breldmg 5807	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐴(⟂G‘𝐺)𝐵) → 𝐴 ∈ dom (⟂G‘𝐺))
41	38, 39, 35, 40	syl3anc 1369	. 2 ⊢ (𝜑 → 𝐴 ∈ dom (⟂G‘𝐺))
42	31, 41	sseldd 3918	1 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883   class class class wbr 5070  {copab 5132   × cxp 5578  dom cdm 5580  ran crn 5581  Rel wrel 5585  ‘cfv 6418  ⟨“cs3 14483  TarskiGcstrkg 26693  LineGclng 26700  ∟Gcrag 26958  ⟂Gcperpg 26960

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-iota 6376  df-fun 6420  df-fv 6426  df-perpg 26961

This theorem is referenced by:  footne  26988  footeq  26989  perpdragALT  26992  perpdrag  26993  colperp  26994  midex  27002  opphl  27019  lmieu  27049  lnperpex  27068  trgcopy  27069