Theorem elplnglnid 29140

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 2760	. . . . 5 ⊢ {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))}
14	3, 5, 4, 8, 10, 1	tglnpt 28891	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝑃)
15	3, 4, 5, 6, 8, 10, 12, 13, 14	elplng 29137	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∈ (𝐴𝐸𝑅) ↔ (𝑧 ∈ 𝐴 ∨ 𝑧((hpG‘𝐺)‘𝐴)𝑅 ∨ 𝑧{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎𝐼𝑏))}𝑅)))
16	2, 15	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ (𝐴𝐸𝑅))
17	16	ex 418	. 2 ⊢ (𝜑 → (𝑧 ∈ 𝐴 → 𝑧 ∈ (𝐴𝐸𝑅)))
18	17	ssrdv 3937	1 ⊢ (𝜑 → 𝐴 ⊆ (𝐴𝐸𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2145  ∃wrex 3086   ∖ cdif 3896   ⊆ wss 3899   class class class wbr 5103  {copab 5167  ran crn 5656  ‘cfv 6533  (class class class)co 7413  Basecbs 17301  TarskiGcstrkg 28768  Itvcitv 28774  LineGclng 28775  hpGchpg 29114  hlGcplng 29130

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-trkg 28794  df-plng 29131

This theorem is used by:  lnincplng  29141  plngrotlem1  29144  lnssplnglem  29148  lnssplng  29149  dfprlng2  29304  prlngex  29308  prlngmolem2  29310  prlngmid2  29318  quadcgrprlng  29323