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

Theorem oppcom 29247
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 29242 . . . . . 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 29039 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝑃)
2322adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝑃)
247ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐵 ∈ 𝑃)
25 simpr 490 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐵))
262, 3, 4, 15, 16, 23, 24, 25tgbtwncom 28978 . . . . . 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 28978 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐴𝐼𝐵))
3326, 32impbida 813 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝐷) → (𝑡 ∈ (𝐴𝐼𝐵) ↔ 𝑡 ∈ (𝐵𝐼𝐴)))
3433rexbidva 3188 . . . 4 (𝜑 → (∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵) ↔ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
3513, 34mpbid 235 . . 3 (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))
3611, 12, 35jca31 524 . 2 (𝜑 → ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
372, 3, 4, 5, 7, 6islnopp 29242 . 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 2147  ∃wrex 3090   ∖ cdif 4048   class class class wbr 5106  {copab 5170  ran crn 5656  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  distcds 17463  TarskiGcstrkg 28916  Itvcitv 28922  LineGclng 28923
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-cnv 5663  df-dm 5665  df-rn 5666  df-iota 6509  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-trkgc 28937  df-trkgb 28938  df-trkgcb 28939  df-trkg 28942
This theorem is used by:  opphllem2  29251  opphllem4  29253  opphllem5  29254  opphllem6  29255  plngcplem  29290  plngrotlem1  29292  plngrotlem2  29293  plngmiropp  29299  nhpmirhp  29303  lnperpex  29336  tgaaddcpbllem1  29376  tgaaddcpbl  29379  angmgmaddeu1  29406  quadcgrprlng  29471  tgaltai  29472
  Copyright terms: Public domain W3C validator