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

Theorem hpgbr 28846
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 28845 . . . 4 (𝜑 → ((hpG‘𝐺)‘𝐷) = {⟨𝑎, 𝑏⟩ ∣ ∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐)})
8 simpl 483 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑎 = 𝑢)
98breq1d 5082 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎𝑂𝑐𝑢𝑂𝑐))
10 simpr 485 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑏 = 𝑣)
1110breq1d 5082 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑏𝑂𝑐𝑣𝑂𝑐))
129, 11anbi12d 638 . . . . . 6 ((𝑎 = 𝑢𝑏 = 𝑣) → ((𝑎𝑂𝑐𝑏𝑂𝑐) ↔ (𝑢𝑂𝑐𝑣𝑂𝑐)))
1312rexbidv 3163 . . . . 5 ((𝑎 = 𝑢𝑏 = 𝑣) → (∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐) ↔ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)))
1413cbvopabv 5145 . . . 4 {⟨𝑎, 𝑏⟩ ∣ ∃𝑐𝑃 (𝑎𝑂𝑐𝑏𝑂𝑐)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}
157, 14eqtrdi 2790 . . 3 (𝜑 → ((hpG‘𝐺)‘𝐷) = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)})
1615breqd 5083 . 2 (𝜑 → (𝐴((hpG‘𝐺)‘𝐷)𝐵𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵))
17 hpgbr.a . . 3 (𝜑𝐴𝑃)
18 hpgbr.b . . 3 (𝜑𝐵𝑃)
19 simpl 483 . . . . . . 7 ((𝑢 = 𝐴𝑣 = 𝐵) → 𝑢 = 𝐴)
2019breq1d 5082 . . . . . 6 ((𝑢 = 𝐴𝑣 = 𝐵) → (𝑢𝑂𝑐𝐴𝑂𝑐))
21 simpr 485 . . . . . . 7 ((𝑢 = 𝐴𝑣 = 𝐵) → 𝑣 = 𝐵)
2221breq1d 5082 . . . . . 6 ((𝑢 = 𝐴𝑣 = 𝐵) → (𝑣𝑂𝑐𝐵𝑂𝑐))
2320, 22anbi12d 638 . . . . 5 ((𝑢 = 𝐴𝑣 = 𝐵) → ((𝑢𝑂𝑐𝑣𝑂𝑐) ↔ (𝐴𝑂𝑐𝐵𝑂𝑐)))
2423rexbidv 3163 . . . 4 ((𝑢 = 𝐴𝑣 = 𝐵) → (∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐) ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
25 eqid 2739 . . . 4 {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}
2624, 25brabga 5476 . . 3 ((𝐴𝑃𝐵𝑃) → (𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
2717, 18, 26syl2anc 590 . 2 (𝜑 → (𝐴{⟨𝑢, 𝑣⟩ ∣ ∃𝑐𝑃 (𝑢𝑂𝑐𝑣𝑂𝑐)}𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
2816, 27bitrd 280 1 (𝜑 → (𝐴((hpG‘𝐺)‘𝐷)𝐵 ↔ ∃𝑐𝑃 (𝐴𝑂𝑐𝐵𝑂𝑐)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wrex 3063  cdif 3880   class class class wbr 5072  {copab 5134  ran crn 5619  cfv 6485  (class class class)co 7356  Basecbs 17170  TarskiGcstrkg 28513  Itvcitv 28519  LineGclng 28520  hpGchpg 28843
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-hpg 28844
This theorem is referenced by:  hpgne1  28847  hpgne2  28848  lnopp2hpgb  28849  hpgid  28852  hpgcom  28853  hpgtr  28854
  Copyright terms: Public domain W3C validator