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

Theorem oppcom 29279
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 29274 . . . . . 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 29071 . . . . . . . 8 ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝑃)
2322adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝑃)
247ad2antrr 739 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐵 ∈ 𝑃)
25 simpr 490 . . . . . . 7 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐵))
262, 3, 4, 15, 16, 23, 24, 25tgbtwncom 29010 . . . . . 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 29010 . . . . . 6 (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐴𝐼𝐵))
3326, 32impbida 813 . . . . 5 ((𝜑 ∧ 𝑡 ∈ 𝐷) → (𝑡 ∈ (𝐴𝐼𝐵) ↔ 𝑡 ∈ (𝐵𝐼𝐴)))
3433rexbidva 3191 . . . 4 (𝜑 → (∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵) ↔ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
3513, 34mpbid 235 . . 3 (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))
3611, 12, 35jca31 524 . 2 (𝜑 → ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
372, 3, 4, 5, 7, 6islnopp 29274 . 2 (𝜑 → (𝐵𝑂𝐴 ↔ ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))))
3836, 37mpbird 260 1 (𝜑 → 𝐵𝑂𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∃wrex 3093   ∖ cdif 4047   class class class wbr 5107  {copab 5172  ran crn 5658  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  distcds 17483  TarskiGcstrkg 28948  Itvcitv 28954  LineGclng 28955
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-cnv 5665  df-dm 5667  df-rn 5668  df-iota 6519  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-trkgc 28969  df-trkgb 28970  df-trkgcb 28971  df-trkg 28974
This theorem is used by:  opphllem2  29283  opphllem4  29285  opphllem5  29286  opphllem6  29287  plngcplem  29322  plngrotlem1  29324  plngrotlem2  29325  plngmiropp  29331  nhpmirhp  29335  lnperpex  29368  tgaaddcpbllem1  29408  tgaaddcpbl  29411  angmgmaddeu1  29438  quadcgrprlng  29503  tgaltai  29504
  Copyright terms: Public domain W3C validator