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

Theorem oppnid 29102
Description: The "opposite to a line" relation is irreflexive. (Contributed by Thierry Arnoux, 4-Mar-2020.)
Hypotheses
Ref Expression
hpg.p 𝑃 = (Base‘𝐺)
hpg.d = (dist‘𝐺)
hpg.i 𝐼 = (Itv‘𝐺)
hpg.o 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
opphl.l 𝐿 = (LineG‘𝐺)
opphl.d (𝜑𝐷 ∈ ran 𝐿)
opphl.g (𝜑𝐺 ∈ TarskiG)
oppnid.1 (𝜑𝐴𝑃)
Assertion
Ref Expression
oppnid (𝜑 → ¬ 𝐴𝑂𝐴)
Distinct variable groups:   𝐷,𝑎,𝑏   𝐼,𝑎,𝑏   𝑃,𝑎,𝑏   𝑡,𝐴   𝑡,𝐷   𝑡,𝐺   𝑡,𝐿   𝑡,𝐼   𝑡,𝑂   𝑡,𝑃   𝜑,𝑡   𝑡,   𝑡,𝑎,𝑏
Allowed substitution hints:   𝜑(𝑎, 𝑏)   𝐴(𝑎, 𝑏)   𝐺(𝑎, 𝑏)   𝐿(𝑎, 𝑏)   (𝑎, 𝑏)   𝑂(𝑎, 𝑏)

Proof of Theorem oppnid
StepHypRef Expression
1 hpg.p . . . . 5 𝑃 = (Base‘𝐺)
2 hpg.d . . . . 5 = (dist‘𝐺)
3 hpg.i . . . . 5 𝐼 = (Itv‘𝐺)
4 opphl.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
54ad3antrrr 743 . . . . 5 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝐺 ∈ TarskiG)
6 oppnid.1 . . . . . 6 (𝜑𝐴𝑃)
76ad3antrrr 743 . . . . 5 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝐴𝑃)
8 opphl.l . . . . . 6 𝐿 = (LineG‘𝐺)
9 opphl.d . . . . . . 7 (𝜑𝐷 ∈ ran 𝐿)
109ad3antrrr 743 . . . . . 6 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝐷 ∈ ran 𝐿)
11 simplr 781 . . . . . 6 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝑡𝐷)
121, 8, 3, 5, 10, 11tglnpt 28892 . . . . 5 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝑡𝑃)
13 simpr 490 . . . . 5 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝑡 ∈ (𝐴𝐼𝐴))
141, 2, 3, 5, 7, 12, 13axtgbtwnid 28808 . . . 4 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝐴 = 𝑡)
1514, 11eqeltrd 2862 . . 3 ((((𝜑𝐴𝑂𝐴) ∧ 𝑡𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐴)) → 𝐴𝐷)
16 hpg.o . . . . 5 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃𝐷) ∧ 𝑏 ∈ (𝑃𝐷)) ∧ ∃𝑡𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
171, 2, 3, 16, 6, 6islnopp 29095 . . . 4 (𝜑 → (𝐴𝑂𝐴 ↔ ((¬ 𝐴𝐷 ∧ ¬ 𝐴𝐷) ∧ ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐴))))
1817simplbda 505 . . 3 ((𝜑𝐴𝑂𝐴) → ∃𝑡𝐷 𝑡 ∈ (𝐴𝐼𝐴))
1915, 18r19.29a 3172 . 2 ((𝜑𝐴𝑂𝐴) → 𝐴𝐷)
2017simprbda 504 . . 3 ((𝜑𝐴𝑂𝐴) → (¬ 𝐴𝐷 ∧ ¬ 𝐴𝐷))
2120simpld 500 . 2 ((𝜑𝐴𝑂𝐴) → ¬ 𝐴𝐷)
2219, 21pm2.65da 829 1 (𝜑 → ¬ 𝐴𝑂𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2145  wrex 3088  cdif 3899   class class class wbr 5107  {copab 5171  ran crn 5660  cfv 6537  (class class class)co 7416  Basecbs 17305  distcds 17355  TarskiGcstrkg 28769  Itvcitv 28775  LineGclng 28776
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-cnv 5667  df-dm 5669  df-rn 5670  df-iota 6493  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-trkgb 28791  df-trkg 28795
This theorem is used by:  lnoppnhpg  29122
  Copyright terms: Public domain W3C validator