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

Theorem hpgbr 29095
Description: Half-planes : property for points 𝐴 and 𝐵 to belong to the same open half plane delimited by line 𝐷. Definition 9.7 of [Schwabhauser] p. 71. (Contributed by Thierry Arnoux, 4-Mar-2020.)
Hypotheses
Ref Expression
ishpg.p 𝑃 = (Base‘𝐺)
ishpg.i 𝐼 = (Itv‘𝐺)
ishpg.l 𝐿 = (LineG‘𝐺)
ishpg.o 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
ishpg.g (𝜑𝐺 ∈ TarskiG)
ishpg.d (𝜑𝐷 ∈ ran 𝐿)
hpgbr.a (𝜑𝐴𝑃)
hpgbr.b (𝜑𝐵𝑃)
Assertion
Ref Expression
hpgbr (𝜑 → (𝐴((hpG‘𝐺)‘𝐷)𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
Distinct variable groups:   𝐴,𝑐   𝐵,𝑐   𝐷,𝑎,𝑏,𝑐,𝑡   𝐺,𝑎,𝑏   𝐼,𝑎,𝑏,𝑐,𝑡   𝑂,𝑎,𝑏   𝑃,𝑎,𝑏,𝑐,𝑡
Allowed substitution hints:   𝜑(𝑡, 𝑎, 𝑏, 𝑐)   𝐴(𝑡, 𝑎, 𝑏)   𝐵(𝑡, 𝑎, 𝑏)   𝐺(𝑡, 𝑐)   𝐿(𝑡, 𝑎, 𝑏, 𝑐)   𝑂(𝑡, 𝑐)

Proof of Theorem hpgbr
Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ishpg.p . . . . 5 𝑃 = (Base‘𝐺)
2 ishpg.i . . . . 5 𝐼 = (Itv‘𝐺)
3 ishpg.l . . . . 5 𝐿 = (LineG‘𝐺)
4 ishpg.o . . . . 5 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
5 ishpg.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
6 ishpg.d . . . . 5 (𝜑𝐷 ∈ ran 𝐿)
71, 2, 3, 4, 5, 6ishpg 29094 . . . 4 (𝜑 → ((hpG‘𝐺)‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐)})
8 simpl 488 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑎 = 𝑢)
98breq1d 5121 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎𝑂𝑐𝑢𝑂𝑐))
10 simpr 490 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑏 = 𝑣)
1110breq1d 5121 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑏𝑂𝑐𝑣𝑂𝑐))
129, 11anbi12d 644 . . . . . 6 ((𝑎 = 𝑢𝑏 = 𝑣) → ((𝑎𝑂𝑐𝑏𝑂𝑐) ↔ (𝑢𝑂𝑐𝑣𝑂𝑐)))
1312rexbidv 3191 . . . . 5 ((𝑎 = 𝑢𝑏 = 𝑣) → (∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐) ↔ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)))
1413cbvopabv 5186 . . . 4 {⟨𝑎, 𝑏⟩ ∣ ∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}
157, 14eqtrdi 2816 . . 3 (𝜑 → ((hpG‘𝐺)‘𝐷) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)})
1615breqd 5122 . 2 (𝜑 → (𝐴((hpG‘𝐺)‘𝐷)𝐵𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵))
17 hpgbr.a . . 3 (𝜑𝐴𝑃)
18 hpgbr.b . . 3 (𝜑𝐵𝑃)
19 simpl 488 . . . . . . 7 ((𝑢 = 𝐴𝑣 = 𝐵) → 𝑢 = 𝐴)
2019breq1d 5121 . . . . . 6 ((𝑢 = 𝐴𝑣 = 𝐵) → (𝑢𝑂𝑐𝐴𝑂𝑐))
21 simpr 490 . . . . . . 7 ((𝑢 = 𝐴𝑣 = 𝐵) → 𝑣 = 𝐵)
2221breq1d 5121 . . . . . 6 ((𝑢 = 𝐴𝑣 = 𝐵) → (𝑣𝑂𝑐𝐵𝑂𝑐))
2320, 22anbi12d 644 . . . . 5 ((𝑢 = 𝐴𝑣 = 𝐵) → ((𝑢𝑂𝑐𝑣𝑂𝑐) ↔ (𝐴𝑂𝑐𝐵𝑂𝑐)))
2423rexbidv 3191 . . . 4 ((𝑢 = 𝐴𝑣 = 𝐵) → (∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐) ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
25 eqid 2765 . . . 4 {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}
2624, 25brabga 5520 . . 3 ((𝐴𝑃𝐵𝑃) → (𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
2717, 18, 26syl2anc 596 . 2 (𝜑 → (𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
2816, 27bitrd 282 1 (𝜑 → (𝐴((hpG‘𝐺)‘𝐷)𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wrex 3091  cdif 3903   class class class wbr 5111  {copab 5175  ran crn 5664  cfv 6540  (class class class)co 7419  Basecbs 17293  TarskiGcstrkg 28749  Itvcitv 28755  LineGclng 28756  hpGchpg 29092
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-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-hpg 29093
This theorem is used by:  hpgne1  29096  hpgne2  29097  lnopp2hpgb  29098  hpgid  29101  hpgcom  29102  hpgtr  29103
  Copyright terms: Public domain W3C validator