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

Theorem islnopp 27744
Description: The property for two points 𝐴 and 𝐵 to lie on the opposite sides of a set 𝐷 Definition 9.1 of [Schwabhauser] p. 67. (Contributed by Thierry Arnoux, 19-Dec-2019.)
Hypotheses
Ref Expression
hpg.p 𝑃 = (Base‘𝐺)
hpg.d = (dist‘𝐺)
hpg.i 𝐼 = (Itv‘𝐺)
hpg.o 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
islnopp.a (𝜑𝐴𝑃)
islnopp.b (𝜑𝐵𝑃)
Assertion
Ref Expression
islnopp (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
Distinct variable groups:   𝐷,𝑎,𝑏   𝐼,𝑎,𝑏   𝑃,𝑎,𝑏   𝑡,𝐴   𝑡,𝐵   𝑡,𝑎,𝑏
Allowed substitution hints:   𝜑(𝑡,𝑎,𝑏)   𝐴(𝑎,𝑏)   𝐵(𝑎,𝑏)   𝐷(𝑡)   𝑃(𝑡)   𝐺(𝑡,𝑎,𝑏)   𝐼(𝑡)   (𝑡,𝑎,𝑏)   𝑂(𝑡,𝑎,𝑏)

Proof of Theorem islnopp
Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 islnopp.a . . 3 (𝜑𝐴𝑃)
2 islnopp.b . . 3 (𝜑𝐵𝑃)
3 eleq1 2820 . . . . . 6 (𝑢 = 𝐴 → (𝑢 ∈ (𝑃𝐷) ↔ 𝐴 ∈ (𝑃𝐷)))
43anbi1d 630 . . . . 5 (𝑢 = 𝐴 → ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷))))
5 oveq1 7369 . . . . . . 7 (𝑢 = 𝐴 → (𝑢𝐼𝑣) = (𝐴𝐼𝑣))
65eleq2d 2818 . . . . . 6 (𝑢 = 𝐴 → (𝑡 ∈ (𝑢𝐼𝑣) ↔ 𝑡 ∈ (𝐴𝐼𝑣)))
76rexbidv 3171 . . . . 5 (𝑢 = 𝐴 → (∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣) ↔ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣)))
84, 7anbi12d 631 . . . 4 (𝑢 = 𝐴 → (((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣))))
9 eleq1 2820 . . . . . 6 (𝑣 = 𝐵 → (𝑣 ∈ (𝑃𝐷) ↔ 𝐵 ∈ (𝑃𝐷)))
109anbi2d 629 . . . . 5 (𝑣 = 𝐵 → ((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷))))
11 oveq2 7370 . . . . . . 7 (𝑣 = 𝐵 → (𝐴𝐼𝑣) = (𝐴𝐼𝐵))
1211eleq2d 2818 . . . . . 6 (𝑣 = 𝐵 → (𝑡 ∈ (𝐴𝐼𝑣) ↔ 𝑡 ∈ (𝐴𝐼𝐵)))
1312rexbidv 3171 . . . . 5 (𝑣 = 𝐵 → (∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣) ↔ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵)))
1410, 13anbi12d 631 . . . 4 (𝑣 = 𝐵 → (((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
15 hpg.o . . . . 5 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
16 simpl 483 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑎 = 𝑢)
1716eleq1d 2817 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎 ∈ (𝑃𝐷) ↔ 𝑢 ∈ (𝑃𝐷)))
18 simpr 485 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑏 = 𝑣)
1918eleq1d 2817 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑏 ∈ (𝑃𝐷) ↔ 𝑣 ∈ (𝑃𝐷)))
2017, 19anbi12d 631 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ↔ (𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷))))
21 oveq12 7371 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎𝐼𝑏) = (𝑢𝐼𝑣))
2221eleq2d 2818 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑡 ∈ (𝑎𝐼𝑏) ↔ 𝑡 ∈ (𝑢𝐼𝑣)))
2322rexbidv 3171 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏) ↔ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣)))
2420, 23anbi12d 631 . . . . . 6 ((𝑎 = 𝑢𝑏 = 𝑣) → (((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏)) ↔ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))))
2524cbvopabv 5183 . . . . 5 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))} = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))}
2615, 25eqtri 2759 . . . 4 𝑂 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))}
278, 14, 26brabg 5501 . . 3 ((𝐴𝑃𝐵𝑃) → (𝐴𝑂𝐵 ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
281, 2, 27syl2anc 584 . 2 (𝜑 → (𝐴𝑂𝐵 ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
291biantrurd 533 . . . . 5 (𝜑 → (¬ 𝐴𝐷 ↔ (𝐴𝑃 ∧ ¬ 𝐴𝐷)))
30 eldif 3923 . . . . 5 (𝐴 ∈ (𝑃𝐷) ↔ (𝐴𝑃 ∧ ¬ 𝐴𝐷))
3129, 30bitr4di 288 . . . 4 (𝜑 → (¬ 𝐴𝐷𝐴 ∈ (𝑃𝐷)))
322biantrurd 533 . . . . 5 (𝜑 → (¬ 𝐵𝐷 ↔ (𝐵𝑃 ∧ ¬ 𝐵𝐷)))
33 eldif 3923 . . . . 5 (𝐵 ∈ (𝑃𝐷) ↔ (𝐵𝑃 ∧ ¬ 𝐵𝐷))
3432, 33bitr4di 288 . . . 4 (𝜑 → (¬ 𝐵𝐷𝐵 ∈ (𝑃𝐷)))
3531, 34anbi12d 631 . . 3 (𝜑 → ((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷))))
3635anbi1d 630 . 2 (𝜑 → (((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
3728, 36bitr4d 281 1 (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wrex 3069  cdif 3910   class class class wbr 5110  {copab 5172  cfv 6501  (class class class)co 7362  Basecbs 17094  distcds 17156  Itvcitv 27438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pr 5389
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-iota 6453  df-fv 6509  df-ov 7365
This theorem is referenced by:  islnoppd  27745  oppne1  27746  oppne2  27747  oppne3  27748  oppcom  27749  oppnid  27751  opphllem1  27752  opphllem3  27754  opphllem5  27756  opphllem6  27757  oppperpex  27758  outpasch  27760  lnopp2hpgb  27768  hpgerlem  27770  colopp  27774  colhp  27775  trgcopyeulem  27810
  Copyright terms: Public domain W3C validator