Theorem isplng 29313

Description: The property of being a plane. (Contributed by Thierry Arnoux, 17-Jun-2026.)

Hypotheses

Ref	Expression
plngval.p	⊢ 𝑃 = (Base‘𝐺)
plngval.i	⊢ 𝐼 = (Itv‘𝐺)
plngval.1	⊢ 𝐿 = (LineG‘𝐺)
plngval.e	⊢ 𝐸 = (hlG‘𝐺)
plngval.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
isplng.h	⊢ (𝜑 → 𝐻 ∈ ran 𝐸)

Assertion

Ref	Expression
isplng	⊢ (𝜑 → ∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = (𝑎𝐸𝑟))

Distinct variable groups:   𝐺,𝑎,𝑟   𝐻,𝑎,𝑟   𝐿,𝑎,𝑟   𝑃,𝑟   𝜑,𝑎,𝑟

Allowed substitution hints:   𝑃(𝑎)   𝐸(𝑟, 𝑎)   𝐼(𝑟, 𝑎)

Proof of Theorem isplng

Dummy variables 𝑔 𝑡 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isplng.h	. . . 4 ⊢ (𝜑 → 𝐻 ∈ ran 𝐸)
2		plngval.e	. . . . . 6 ⊢ 𝐸 = (hlG‘𝐺)
3		df-plng 29309	. . . . . . 7 ⊢ hlG = (𝑔 ∈ V ↦ (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}))
4		fveq2 6916	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (LineG‘𝑔) = (LineG‘𝐺))
5		plngval.1	. . . . . . . . . 10 ⊢ 𝐿 = (LineG‘𝐺)
6	4, 5	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (LineG‘𝑔) = 𝐿)
7	6	rneqd 5932	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ran (LineG‘𝑔) = ran 𝐿)
8		fveq2 6916	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
9		plngval.p	. . . . . . . . . 10 ⊢ 𝑃 = (Base‘𝐺)
10	8, 9	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑃)
11	10	difeq1d 4065	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((Base‘𝑔) ∖ 𝑎) = (𝑃 ∖ 𝑎))
12		biidd 265	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ 𝑎 ↔ 𝑥 ∈ 𝑎))
13		fveq2 6916	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → (hpG‘𝑔) = (hpG‘𝐺))
14	13	fveq1d 6918	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → ((hpG‘𝑔)‘𝑎) = ((hpG‘𝐺)‘𝑎))
15	14	breqd 5119	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (𝑥((hpG‘𝑔)‘𝑎)𝑟 ↔ 𝑥((hpG‘𝐺)‘𝑎)𝑟))
16		fveq2 6916	. . . . . . . . . . . . . 14 ⊢ (𝑔 = 𝐺 → (Itv‘𝑔) = (Itv‘𝐺))
17		plngval.i	. . . . . . . . . . . . . 14 ⊢ 𝐼 = (Itv‘𝐺)
18	16, 17	eqtr4di 2816	. . . . . . . . . . . . 13 ⊢ (𝑔 = 𝐺 → (Itv‘𝑔) = 𝐼)
19	18	oveqd 7468	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝐺 → (𝑥(Itv‘𝑔)𝑟) = (𝑥𝐼𝑟))
20	19	eleq2d 2850	. . . . . . . . . . 11 ⊢ (𝑔 = 𝐺 → (𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ 𝑡 ∈ (𝑥𝐼𝑟)))
21	20	rexbidv 3190	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟) ↔ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟)))
22	12, 15, 21	3orbi123d 1464	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → ((𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟)) ↔ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))))
23	10, 22	rabeqbidv 3433	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → {𝑥 ∈ (Base‘𝑔) ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))} = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
24	7, 11, 23	mpoeq123dv 7526	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑎 ∈ ran (LineG‘𝑔), 𝑟 ∈ ((Base‘𝑔) ∖ 𝑎) ↦ {𝑥 ∈ (Base‘𝑔) ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝑔)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥(Itv‘𝑔)𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
25		plngval.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
26	25	elexd 3477	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ V)
27	5	fvexi 6930	. . . . . . . . . 10 ⊢ 𝐿 ∈ V
28	27	rnex 7956	. . . . . . . . 9 ⊢ ran 𝐿 ∈ V
29	28	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ran 𝐿 ∈ V)
30	9	fvexi 6930	. . . . . . . . . 10 ⊢ 𝑃 ∈ V
31	30	difexi 5299	. . . . . . . . 9 ⊢ (𝑃 ∖ 𝑎) ∈ V
32	31	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ ran 𝐿) → (𝑃 ∖ 𝑎) ∈ V)
33	29, 32	mpoexd 8128	. . . . . . 7 ⊢ (𝜑 → (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ∈ V)
34	3, 24, 26, 33	fvmptd3 7048	. . . . . 6 ⊢ (𝜑 → (hlG‘𝐺) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
35	2, 34	eqtrid 2810	. . . . 5 ⊢ (𝜑 → 𝐸 = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
36	35	rneqd 5932	. . . 4 ⊢ (𝜑 → ran 𝐸 = ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
37	1, 36	eleqtrd 2866	. . 3 ⊢ (𝜑 → 𝐻 ∈ ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
38		eqid 2763	. . . 4 ⊢ (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) = (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
39	30	rabex 5307	. . . 4 ⊢ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))} ∈ V
40	38, 39	elrnmpo 7588	. . 3 ⊢ (𝐻 ∈ ran (𝑎 ∈ ran 𝐿, 𝑟 ∈ (𝑃 ∖ 𝑎) ↦ {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}) ↔ ∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
41	37, 40	sylib 221	. 2 ⊢ (𝜑 → ∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
42	25	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → 𝐺 ∈ TarskiG)
43		simplr 781	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → 𝑎 ∈ ran 𝐿)
44		simpr 490	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → 𝑟 ∈ (𝑃 ∖ 𝑎))
45	9, 17, 5, 2, 42, 43, 44	plngval 29312	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → (𝑎𝐸𝑟) = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))})
46	45	eqeq2d 2774	. . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → (𝐻 = (𝑎𝐸𝑟) ↔ 𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))}))
47	46	biimprd 251	. . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ ran 𝐿) ∧ 𝑟 ∈ (𝑃 ∖ 𝑎)) → (𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → 𝐻 = (𝑎𝐸𝑟)))
48	47	anasss 472	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ ran 𝐿 ∧ 𝑟 ∈ (𝑃 ∖ 𝑎))) → (𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → 𝐻 = (𝑎𝐸𝑟)))
49	48	reximdvva 3214	. 2 ⊢ (𝜑 → (∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = {𝑥 ∈ 𝑃 ∣ (𝑥 ∈ 𝑎 ∨ 𝑥((hpG‘𝐺)‘𝑎)𝑟 ∨ ∃𝑡 ∈ 𝑎 𝑡 ∈ (𝑥𝐼𝑟))} → ∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = (𝑎𝐸𝑟)))
50	41, 49	mpd 16	1 ⊢ (𝜑 → ∃𝑎 ∈ ran 𝐿∃𝑟 ∈ (𝑃 ∖ 𝑎)𝐻 = (𝑎𝐸𝑟))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416  Vcvv 3454   ∖ cdif 4048   class class class wbr 5108  ran crn 5659  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Basecbs 17431  TarskiGcstrkg 28946  Itvcitv 28952  LineGclng 28953  hpGchpg 29292  hlGcplng 29308

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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-reu 3370  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-plng 29309

This theorem is used by:  plngrnssp  29314  lnssplng  29327