Theorem perpln2 27962

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
perpln2	⊢ (𝜑 → 𝐵 ∈ ran 𝐿)

Proof of Theorem perpln2

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

Step	Hyp	Ref	Expression
1		df-perpg 27947	. . . . . 6 ⊢ ⟂G = (𝑔 ∈ V ↦ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))})
2		simpr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
3	2	fveq2d 6896	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = (LineG‘𝐺))
4		perpln.l	. . . . . . . . . . . 12 ⊢ 𝐿 = (LineG‘𝐺)
5	3, 4	eqtr4di 2791	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (LineG‘𝑔) = 𝐿)
6	5	rneqd 5938	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ran (LineG‘𝑔) = ran 𝐿)
7	6	eleq2d 2820	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑎 ∈ ran (LineG‘𝑔) ↔ 𝑎 ∈ ran 𝐿))
8	6	eleq2d 2820	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (𝑏 ∈ ran (LineG‘𝑔) ↔ 𝑏 ∈ ran 𝐿))
9	7, 8	anbi12d 632	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ↔ (𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿)))
10	2	fveq2d 6896	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∟G‘𝑔) = (∟G‘𝐺))
11	10	eleq2d 2820	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
12	11	ralbidv 3178	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
13	12	rexralbidv 3221	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔) ↔ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺)))
14	9, 13	anbi12d 632	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → (((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔)) ↔ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))))
15	14	opabbidv 5215	. . . . . 6 ⊢ ((𝜑 ∧ 𝑔 = 𝐺) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran (LineG‘𝑔) ∧ 𝑏 ∈ ran (LineG‘𝑔)) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝑔))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
16		perpln.1	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
17	16	elexd 3495	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ V)
18	4	fvexi 6906	. . . . . . . . 9 ⊢ 𝐿 ∈ V
19		rnexg 7895	. . . . . . . . 9 ⊢ (𝐿 ∈ V → ran 𝐿 ∈ V)
20	18, 19	mp1i 13	. . . . . . . 8 ⊢ (𝜑 → ran 𝐿 ∈ V)
21	20, 20	xpexd 7738	. . . . . . 7 ⊢ (𝜑 → (ran 𝐿 × ran 𝐿) ∈ V)
22		opabssxp 5769	. . . . . . . 8 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿)
23	22	a1i 11	. . . . . . 7 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ (ran 𝐿 × ran 𝐿))
24	21, 23	ssexd 5325	. . . . . 6 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ∈ V)
25	1, 15, 17, 24	fvmptd2 7007	. . . . 5 ⊢ (𝜑 → (⟂G‘𝐺) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
26	25	rneqd 5938	. . . 4 ⊢ (𝜑 → ran (⟂G‘𝐺) = ran {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))})
27	22	rnssi 5940	. . . 4 ⊢ ran {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))} ⊆ ran (ran 𝐿 × ran 𝐿)
28	26, 27	eqsstrdi 4037	. . 3 ⊢ (𝜑 → ran (⟂G‘𝐺) ⊆ ran (ran 𝐿 × ran 𝐿))
29		rnxpss 6172	. . 3 ⊢ ran (ran 𝐿 × ran 𝐿) ⊆ ran 𝐿
30	28, 29	sstrdi 3995	. 2 ⊢ (𝜑 → ran (⟂G‘𝐺) ⊆ ran 𝐿)
31		relopabv 5822	. . . . . 6 ⊢ Rel {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}
32	25	releqd 5779	. . . . . 6 ⊢ (𝜑 → (Rel (⟂G‘𝐺) ↔ Rel {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ ran 𝐿 ∧ 𝑏 ∈ ran 𝐿) ∧ ∃𝑥 ∈ (𝑎 ∩ 𝑏)∀𝑢 ∈ 𝑎 ∀𝑣 ∈ 𝑏 ⟨“𝑢𝑥𝑣”⟩ ∈ (∟G‘𝐺))}))
33	31, 32	mpbiri 258	. . . . 5 ⊢ (𝜑 → Rel (⟂G‘𝐺))
34		perpln.2	. . . . 5 ⊢ (𝜑 → 𝐴(⟂G‘𝐺)𝐵)
35		brrelex12 5729	. . . . 5 ⊢ ((Rel (⟂G‘𝐺) ∧ 𝐴(⟂G‘𝐺)𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
36	33, 34, 35	syl2anc 585	. . . 4 ⊢ (𝜑 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
37	36	simpld 496	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
38	36	simprd 497	. . 3 ⊢ (𝜑 → 𝐵 ∈ V)
39		brelrng 5941	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐴(⟂G‘𝐺)𝐵) → 𝐵 ∈ ran (⟂G‘𝐺))
40	37, 38, 34, 39	syl3anc 1372	. 2 ⊢ (𝜑 → 𝐵 ∈ ran (⟂G‘𝐺))
41	30, 40	sseldd 3984	1 ⊢ (𝜑 → 𝐵 ∈ ran 𝐿)

Syntax hints:   → wi 4   ∧ wa 397   = wceq 1542   ∈ wcel 2107  ∀wral 3062  ∃wrex 3071  Vcvv 3475   ∩ cin 3948   ⊆ wss 3949   class class class wbr 5149  {copab 5211   × cxp 5675  ran crn 5678  Rel wrel 5682  ‘cfv 6544  ⟨“cs3 14793  TarskiGcstrkg 27678  LineGclng 27685  ∟Gcrag 27944  ⟂Gcperpg 27946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-iota 6496  df-fun 6546  df-fv 6552  df-perpg 27947

This theorem is referenced by:  hlperpnel  27976  mideulem2  27985  opphllem  27986  opphllem3  28000  opphllem5  28002  opphllem6  28003  trgcopy  28055