MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hpgssplng Structured version   Visualization version   GIF version

Theorem hpgssplng 29331
Description: Any point 𝑋 on a half plane defined by a line 𝐴 and another point 𝑌 is on the plane defined by 𝐴 and 𝑌. (Contributed by Thierry Arnoux, 5-Jul-2026.)
Hypotheses
Ref Expression
hpgssplng.p 𝑃 = (Base‘𝐺)
hpgssplng.l 𝐿 = (LineG‘𝐺)
hpgssplng.e 𝐸 = (hlG‘𝐺)
hpgssplng.a (𝜑 → 𝐴 ∈ ran 𝐿)
hpgssplng.x (𝜑 → 𝑋 ∈ 𝑃)
hpgssplng.y (𝜑 → 𝑌 ∈ (𝑃 ∖ 𝐴))
hpgssplng.g (𝜑 → 𝐺 ∈ TarskiG)
hpgssplng.1 (𝜑 → 𝑋((hpG‘𝐺)‘𝐴)𝑌)
Assertion
Ref Expression
hpgssplng (𝜑 → 𝑋 ∈ (𝐴𝐸𝑌))

Proof of Theorem hpgssplng
Dummy variables 𝑎 𝑏 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 hpgssplng.1 . . 3 (𝜑 → 𝑋((hpG‘𝐺)‘𝐴)𝑌)
213mix2d 1356 . 2 (𝜑 → (𝑋 ∈ 𝐴 ∨ 𝑋((hpG‘𝐺)‘𝐴)𝑌 ∨ 𝑋{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))}𝑌))
3 hpgssplng.p . . 3 𝑃 = (Base‘𝐺)
4 eqid 2763 . . 3 (Itv‘𝐺) = (Itv‘𝐺)
5 hpgssplng.l . . 3 𝐿 = (LineG‘𝐺)
6 hpgssplng.e . . 3 𝐸 = (hlG‘𝐺)
7 hpgssplng.g . . 3 (𝜑 → 𝐺 ∈ TarskiG)
8 hpgssplng.a . . 3 (𝜑 → 𝐴 ∈ ran 𝐿)
9 hpgssplng.y . . 3 (𝜑 → 𝑌 ∈ (𝑃 ∖ 𝐴))
10 eqid 2763 . . 3 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))}
11 hpgssplng.x . . 3 (𝜑 → 𝑋 ∈ 𝑃)
123, 4, 5, 6, 7, 8, 9, 10, 11elplng 29315 . 2 (𝜑 → (𝑋 ∈ (𝐴𝐸𝑌) ↔ (𝑋 ∈ 𝐴 ∨ 𝑋((hpG‘𝐺)‘𝐴)𝑌 ∨ 𝑋{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))}𝑌)))
132, 12mpbird 260 1 (𝜑 → 𝑋 ∈ (𝐴𝐸𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ∖ 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-plng 29309
This theorem is used by:  dfprlng2  29482  prlngpln3  29484  prlngex  29486  prlngmolem2  29488
  Copyright terms: Public domain W3C validator