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

Theorem islnopp 25631
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 2689 . . . . . 6 (𝑢 = 𝐴 → (𝑢 ∈ (𝑃𝐷) ↔ 𝐴 ∈ (𝑃𝐷)))
43anbi1d 741 . . . . 5 (𝑢 = 𝐴 → ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷))))
5 id 22 . . . . . . . 8 (𝑢 = 𝐴𝑢 = 𝐴)
65oveq1d 6665 . . . . . . 7 (𝑢 = 𝐴 → (𝑢𝐼𝑣) = (𝐴𝐼𝑣))
76eleq2d 2687 . . . . . 6 (𝑢 = 𝐴 → (𝑡 ∈ (𝑢𝐼𝑣) ↔ 𝑡 ∈ (𝐴𝐼𝑣)))
87rexbidv 3052 . . . . 5 (𝑢 = 𝐴 → (∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣) ↔ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣)))
94, 8anbi12d 747 . . . 4 (𝑢 = 𝐴 → (((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣))))
10 eleq1 2689 . . . . . 6 (𝑣 = 𝐵 → (𝑣 ∈ (𝑃𝐷) ↔ 𝐵 ∈ (𝑃𝐷)))
1110anbi2d 740 . . . . 5 (𝑣 = 𝐵 → ((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷))))
12 oveq2 6658 . . . . . . 7 (𝑣 = 𝐵 → (𝐴𝐼𝑣) = (𝐴𝐼𝐵))
1312eleq2d 2687 . . . . . 6 (𝑣 = 𝐵 → (𝑡 ∈ (𝐴𝐼𝑣) ↔ 𝑡 ∈ (𝐴𝐼𝐵)))
1413rexbidv 3052 . . . . 5 (𝑣 = 𝐵 → (∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣) ↔ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵)))
1511, 14anbi12d 747 . . . 4 (𝑣 = 𝐵 → (((𝐴 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝑣)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
16 hpg.o . . . . 5 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
17 simpl 473 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑎 = 𝑢)
18 eqidd 2623 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑃𝐷) = (𝑃𝐷))
1917, 18eleq12d 2695 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎 ∈ (𝑃𝐷) ↔ 𝑢 ∈ (𝑃𝐷)))
20 simpr 477 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → 𝑏 = 𝑣)
2120, 18eleq12d 2695 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑏 ∈ (𝑃𝐷) ↔ 𝑣 ∈ (𝑃𝐷)))
2219, 21anbi12d 747 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ↔ (𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷))))
23 oveq12 6659 . . . . . . . . 9 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑎𝐼𝑏) = (𝑢𝐼𝑣))
2423eleq2d 2687 . . . . . . . 8 ((𝑎 = 𝑢𝑏 = 𝑣) → (𝑡 ∈ (𝑎𝐼𝑏) ↔ 𝑡 ∈ (𝑢𝐼𝑣)))
2524rexbidv 3052 . . . . . . 7 ((𝑎 = 𝑢𝑏 = 𝑣) → (∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏) ↔ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣)))
2622, 25anbi12d 747 . . . . . 6 ((𝑎 = 𝑢𝑏 = 𝑣) → (((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏)) ↔ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))))
2726cbvopabv 4722 . . . . 5 {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))} = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))}
2816, 27eqtri 2644 . . . 4 𝑂 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝑃𝐷) ∧ 𝑣 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑢𝐼𝑣))}
299, 15, 28brabg 4994 . . 3 ((𝐴𝑃𝐵𝑃) → (𝐴𝑂𝐵 ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
301, 2, 29syl2anc 693 . 2 (𝜑 → (𝐴𝑂𝐵 ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
311biantrurd 529 . . . . 5 (𝜑 → (¬ 𝐴𝐷 ↔ (𝐴𝑃 ∧ ¬ 𝐴𝐷)))
32 eldif 3584 . . . . 5 (𝐴 ∈ (𝑃𝐷) ↔ (𝐴𝑃 ∧ ¬ 𝐴𝐷))
3331, 32syl6bbr 278 . . . 4 (𝜑 → (¬ 𝐴𝐷𝐴 ∈ (𝑃𝐷)))
342biantrurd 529 . . . . 5 (𝜑 → (¬ 𝐵𝐷 ↔ (𝐵𝑃 ∧ ¬ 𝐵𝐷)))
35 eldif 3584 . . . . 5 (𝐵 ∈ (𝑃𝐷) ↔ (𝐵𝑃 ∧ ¬ 𝐵𝐷))
3634, 35syl6bbr 278 . . . 4 (𝜑 → (¬ 𝐵𝐷𝐵 ∈ (𝑃𝐷)))
3733, 36anbi12d 747 . . 3 (𝜑 → ((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ↔ (𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷))))
3837anbi1d 741 . 2 (𝜑 → (((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵)) ↔ ((𝐴 ∈ (𝑃𝐷) ∧ 𝐵 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
3930, 38bitr4d 271 1 (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴𝐷 ∧ ¬ 𝐵𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wrex 2913  cdif 3571   class class class wbr 4653  {copab 4712  cfv 5888  (class class class)co 6650  Basecbs 15857  distcds 15950  Itvcitv 25335
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-iota 5851  df-fv 5896  df-ov 6653
This theorem is referenced by:  islnoppd  25632  oppne1  25633  oppne2  25634  oppne3  25635  oppcom  25636  oppnid  25638  opphllem1  25639  opphllem3  25641  opphllem4  25642  opphllem5  25643  opphllem6  25644  oppperpex  25645  outpasch  25647  lnopp2hpgb  25655  hpgerlem  25657  colopp  25661  colhp  25662  lmiopp  25694  trgcopyeulem  25697
  Copyright terms: Public domain W3C validator