Theorem elplnglnid 29116

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2146  ∃wrex 3091   ∖ cdif 3903   ⊆ wss 3906   class class class wbr 5111  {copab 5175  ran crn 5664  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  TarskiGcstrkg 28747  Itvcitv 28753  LineGclng 28754  hpGchpg 29090  hlGcplng 29106

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-trkg 28773  df-plng 29107

This theorem is used by:  lnincplng  29117  plngrotlem1  29120  lnssplnglem  29124  lnssplng  29125  dfprlng2  29252  prlngex  29256  prlngmolem2  29258  prlngmid2  29266  quadcgrprlng  29271