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

Theorem oppcom 29220
Description: Commutativity rule for "opposite" Theorem 9.2 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 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
opphl.l 𝐿 = (LineG‘𝐺)
opphl.d (𝜑 → 𝐷 ∈ ran 𝐿)
opphl.g (𝜑 → 𝐺 ∈ TarskiG)
oppcom.a (𝜑 → 𝐴 ∈ 𝑃)
oppcom.b (𝜑 → 𝐵 ∈ 𝑃)
oppcom.o (𝜑 → 𝐴𝑂𝐵)
Assertion
Ref Expression
oppcom (𝜑 → 𝐵𝑂𝐴)
Distinct variable groups:   𝐷,𝑎,𝑏   𝐼,𝑎,𝑏   𝑃,𝑎,𝑏   𝑡,𝐴   𝑡,𝐵   𝑡,𝐷   𝑡,𝐺   𝑡,𝐿   𝑡,𝐼   𝑡,𝑂   𝑡,𝑃   𝜑,𝑡   𝑡, −   𝑡,𝑎,𝑏
Allowed substitution hints:   𝜑(𝑎, 𝑏)   𝐴(𝑎, 𝑏)   𝐵(𝑎, 𝑏)   𝐺(𝑎, 𝑏)   𝐿(𝑎, 𝑏)   − (𝑎, 𝑏)   𝑂(𝑎, 𝑏)

Proof of Theorem oppcom
StepHypRef Expression
1 oppcom.o . . . . . 6 (𝜑 → 𝐴𝑂𝐵)
2 hpg.p . . . . . . 7 𝑃 = (Base‘𝐺)
3 hpg.d . . . . . . 7 − = (dist‘𝐺)
4 hpg.i . . . . . . 7 𝐼 = (Itv‘𝐺)
5 hpg.o . . . . . . 7 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
6 oppcom.a . . . . . . 7 (𝜑 → 𝐴 ∈ 𝑃)
7 oppcom.b . . . . . . 7 (𝜑 → 𝐵 ∈ 𝑃)
82, 3, 4, 5, 6, 7islnopp 29215 . . . . . 6 (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
91, 8mpbid 235 . . . . 5 (𝜑 → ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵)))
109simpld 500 . . . 4 (𝜑 → (¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷))
1110simprd 501 . . 3 (𝜑 → ¬ 𝐵 ∈ 𝐷)
1210simpld 500 . . 3 (𝜑 → ¬ 𝐴 ∈ 𝐷)
139simprd 501 . . . 4 (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵))
14 opphl.g . . . . . . . 8 (𝜑 → 𝐺 ∈ TarskiG)
1514ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐺 ∈ TarskiG)
166ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 ∈ 𝑃)
17 opphl.l . . . . . . . . 9 𝐿 = (LineG‘𝐺)
1814adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝐺 ∈ TarskiG)
19 opphl.d . . . . . . . . . 10 (𝜑 → 𝐷 ∈ ran 𝐿)
2019adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝐷 ∈ ran 𝐿)
21 simpr 490 . . . . . . . . 9 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝐷)
222, 17, 4, 18, 20, 21tglnpt 29012 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝑃)
2322adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝑃)
247ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐵 ∈ 𝑃)
25 simpr 490 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐵))
262, 3, 4, 15, 16, 23, 24, 25tgbtwncom 28951 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐵𝐼𝐴))
2714ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐺 ∈ TarskiG)
287ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐵 ∈ 𝑃)
2922adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ 𝑃)
306ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐴 ∈ 𝑃)
31 simpr 490 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐵𝐼𝐴))
322, 3, 4, 27, 28, 29, 30, 31tgbtwncom 28951 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐴𝐼𝐵))
3326, 32impbida 813 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝐷) → (𝑡 ∈ (𝐴𝐼𝐵) ↔ 𝑡 ∈ (𝐵𝐼𝐴)))
3433rexbidva 3185 . . . 4 (𝜑 → (∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵) ↔ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
3513, 34mpbid 235 . . 3 (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))
3611, 12, 35jca31 524 . 2 (𝜑 → ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
372, 3, 4, 5, 7, 6islnopp 29215 . 2 (𝜑 → (𝐵𝑂𝐴 ↔ ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))))
3836, 37mpbird 260 1 (𝜑 → 𝐵𝑂𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ∖ cdif 3896   class class class wbr 5103  {copab 5167  ran crn 5652  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  distcds 17437  TarskiGcstrkg 28889  Itvcitv 28895  LineGclng 28896
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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-cnv 5659  df-dm 5661  df-rn 5662  df-iota 6494  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-trkgc 28910  df-trkgb 28911  df-trkgcb 28912  df-trkg 28915
This theorem is used by:  opphllem2  29224  opphllem4  29226  opphllem5  29227  opphllem6  29228  plngcplem  29263  plngrotlem1  29265  plngrotlem2  29266  plngmiropp  29272  nhpmirhp  29276  lnperpex  29309  tgaaddcpbllem1  29349  tgaaddcpbl  29352  angmgmaddeu1  29379  quadcgrprlng  29444  tgaltai  29445
  Copyright terms: Public domain W3C validator