Theorem elplnglnid 29318

Description: The line 𝐴 itself is a subset of a plane defined by the line 𝐴 and a point 𝑅. (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)
elplng.a	⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
elplng.r	⊢ (𝜑 → 𝑅 ∈ (𝑃 ∖ 𝐴))

Assertion

Ref	Expression
elplnglnid	⊢ (𝜑 → 𝐴 ⊆ (𝐴𝐸𝑅))

Proof of Theorem elplnglnid

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

Step	Hyp	Ref	Expression
1		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
2	1	3mix1d 1355	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∈ 𝐴 ∨ 𝑧((hpG‘𝐺)‘𝐴)𝑅 ∨ 𝑧{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))}𝑅))
3		plngval.p	. . . . 5 ⊢ 𝑃 = (Base‘𝐺)
4		plngval.i	. . . . 5 ⊢ 𝐼 = (Itv‘𝐺)
5		plngval.1	. . . . 5 ⊢ 𝐿 = (LineG‘𝐺)
6		plngval.e	. . . . 5 ⊢ 𝐸 = (hlG‘𝐺)
7		plngval.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
8	7	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝐺 ∈ TarskiG)
9		elplng.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ran 𝐿)
10	9	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝐴 ∈ ran 𝐿)
11		elplng.r	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ (𝑃 ∖ 𝐴))
12	11	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑅 ∈ (𝑃 ∖ 𝐴))
13		eqid 2763	. . . . 5 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))}
14	3, 5, 4, 8, 10, 1	tglnpt 29069	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝑃)
15	3, 4, 5, 6, 8, 10, 12, 13, 14	elplng 29315	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∈ (𝐴𝐸𝑅) ↔ (𝑧 ∈ 𝐴 ∨ 𝑧((hpG‘𝐺)‘𝐴)𝑅 ∨ 𝑧{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))}𝑅)))
16	2, 15	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ (𝐴𝐸𝑅))
17	16	ex 418	. 2 ⊢ (𝜑 → (𝑧 ∈ 𝐴 → 𝑧 ∈ (𝐴𝐸𝑅)))
18	17	ssrdv 3919	1 ⊢ (𝜑 → 𝐴 ⊆ (𝐴𝐸𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048   class class class wbr 5108  {copab 5173  ran crn 5659  ‘cfv 6566  (class class class)co 7451  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-trkg 28972  df-plng 29309

This theorem is used by:  lnincplng  29319  plngrotlem1  29322  lnssplnglem  29326  lnssplng  29327  dfprlng2  29482  prlngex  29486  prlngmolem2  29488  prlngmid2  29496  quadcgrprlng  29501