Theorem oppcom 28770

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

Step	Hyp	Ref	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 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
8	2, 3, 4, 5, 6, 7	islnopp 28765	. . . . . 6 ⊢ (𝜑 → (𝐴𝑂𝐵 ↔ ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵))))
9	1, 8	mpbid 232	. . . . 5 ⊢ (𝜑 → ((¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵)))
10	9	simpld 494	. . . 4 ⊢ (𝜑 → (¬ 𝐴 ∈ 𝐷 ∧ ¬ 𝐵 ∈ 𝐷))
11	10	simprd 495	. . 3 ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐷)
12	10	simpld 494	. . 3 ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷)
13	9	simprd 495	. . . 4 ⊢ (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵))
14		opphl.g	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
15	14	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐺 ∈ TarskiG)
16	6	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐴 ∈ 𝑃)
17		opphl.l	. . . . . . . . 9 ⊢ 𝐿 = (LineG‘𝐺)
18	14	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝐺 ∈ TarskiG)
19		opphl.d	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
20	19	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝐷 ∈ ran 𝐿)
21		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝐷)
22	2, 17, 4, 18, 20, 21	tglnpt 28575	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐷) → 𝑡 ∈ 𝑃)
23	22	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ 𝑃)
24	7	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝐵 ∈ 𝑃)
25		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐴𝐼𝐵))
26	2, 3, 4, 15, 16, 23, 24, 25	tgbtwncom 28514	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐴𝐼𝐵)) → 𝑡 ∈ (𝐵𝐼𝐴))
27	14	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐺 ∈ TarskiG)
28	7	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐵 ∈ 𝑃)
29	22	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ 𝑃)
30	6	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝐴 ∈ 𝑃)
31		simpr 484	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐵𝐼𝐴))
32	2, 3, 4, 27, 28, 29, 30, 31	tgbtwncom 28514	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝐷) ∧ 𝑡 ∈ (𝐵𝐼𝐴)) → 𝑡 ∈ (𝐴𝐼𝐵))
33	26, 32	impbida 800	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐷) → (𝑡 ∈ (𝐴𝐼𝐵) ↔ 𝑡 ∈ (𝐵𝐼𝐴)))
34	33	rexbidva 3183	. . . 4 ⊢ (𝜑 → (∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐴𝐼𝐵) ↔ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
35	13, 34	mpbid 232	. . 3 ⊢ (𝜑 → ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))
36	11, 12, 35	jca31 514	. 2 ⊢ (𝜑 → ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴)))
37	2, 3, 4, 5, 7, 6	islnopp 28765	. 2 ⊢ (𝜑 → (𝐵𝑂𝐴 ↔ ((¬ 𝐵 ∈ 𝐷 ∧ ¬ 𝐴 ∈ 𝐷) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝐵𝐼𝐴))))
38	36, 37	mpbird 257	1 ⊢ (𝜑 → 𝐵𝑂𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∃wrex 3076   ∖ cdif 3973   class class class wbr 5166  {copab 5228  ran crn 5701  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  distcds 17320  TarskiGcstrkg 28453  Itvcitv 28459  LineGclng 28460

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-cnv 5708  df-dm 5710  df-rn 5711  df-iota 6525  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-trkgc 28474  df-trkgb 28475  df-trkgcb 28476  df-trkg 28479

This theorem is referenced by:  opphllem2  28774  opphllem4  28776  opphllem5  28777  opphllem6  28778  lnperpex  28829