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

Theorem hpgssplng 29280
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 2760 . . 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 2760 . . 3 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐴) ∧ 𝑏 ∈ (𝑃 ∖ 𝐴)) ∧ ∃𝑡 ∈ 𝐴 𝑡 ∈ (𝑎(Itv‘𝐺)𝑏))}
11 hpgssplng.x . . 3 (𝜑 → 𝑋 ∈ 𝑃)
123, 4, 5, 6, 7, 8, 9, 10, 11elplng 29264 . 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 1569   ∈ wcel 2144  ∃wrex 3086   ∖ cdif 4045   class class class wbr 5102  {copab 5166  ran crn 5651  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  TarskiGcstrkg 28895  Itvcitv 28901  LineGclng 28902  hpGchpg 29241  hlGcplng 29257
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-plng 29258
This theorem is used by:  dfprlng2  29431  prlngpln3  29433  prlngex  29435  prlngmolem2  29437
  Copyright terms: Public domain W3C validator