Theorem ecopovsym 8401

Description: Assuming the operation 𝐹 is commutative, show that the relation ∼, specified by the first hypothesis, is symmetric. (Contributed by NM, 27-Aug-1995.) (Revised by Mario Carneiro, 26-Apr-2015.)

Hypotheses

Ref	Expression
ecopopr.1	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
ecopopr.com	⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥)

Assertion

Ref	Expression
ecopovsym	⊢ (𝐴 ∼ 𝐵 → 𝐵 ∼ 𝐴)

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢, +   𝑥,𝑆,𝑦,𝑧,𝑤,𝑣,𝑢

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   𝐵(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)   ∼ (𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem ecopovsym

Dummy variables 𝑓 𝑔 ℎ 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ecopopr.1	. . . . 5 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
2		opabssxp 5645	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
3	1, 2	eqsstri 4003	. . . 4 ⊢ ∼ ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
4	3	brel 5619	. . 3 ⊢ (𝐴 ∼ 𝐵 → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)))
5		eqid 2823	. . . 4 ⊢ (𝑆 × 𝑆) = (𝑆 × 𝑆)
6		breq1 5071	. . . . 5 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ 𝐴 ∼ ⟨ℎ, 𝑡⟩))
7		breq2 5072	. . . . 5 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴))
8	6, 7	bibi12d 348	. . . 4 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → ((⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩) ↔ (𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴)))
9		breq2 5072	. . . . 5 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → (𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ 𝐴 ∼ 𝐵))
10		breq1 5071	. . . . 5 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → (⟨ℎ, 𝑡⟩ ∼ 𝐴 ↔ 𝐵 ∼ 𝐴))
11	9, 10	bibi12d 348	. . . 4 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → ((𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴) ↔ (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴)))
12	1	ecopoveq 8400	. . . . . 6 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + ℎ)))
13		vex 3499	. . . . . . . . 9 ⊢ 𝑓 ∈ V
14		vex 3499	. . . . . . . . 9 ⊢ 𝑡 ∈ V
15		ecopopr.com	. . . . . . . . 9 ⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥)
16	13, 14, 15	caovcom 7347	. . . . . . . 8 ⊢ (𝑓 + 𝑡) = (𝑡 + 𝑓)
17		vex 3499	. . . . . . . . 9 ⊢ 𝑔 ∈ V
18		vex 3499	. . . . . . . . 9 ⊢ ℎ ∈ V
19	17, 18, 15	caovcom 7347	. . . . . . . 8 ⊢ (𝑔 + ℎ) = (ℎ + 𝑔)
20	16, 19	eqeq12i 2838	. . . . . . 7 ⊢ ((𝑓 + 𝑡) = (𝑔 + ℎ) ↔ (𝑡 + 𝑓) = (ℎ + 𝑔))
21		eqcom 2830	. . . . . . 7 ⊢ ((𝑡 + 𝑓) = (ℎ + 𝑔) ↔ (ℎ + 𝑔) = (𝑡 + 𝑓))
22	20, 21	bitri 277	. . . . . 6 ⊢ ((𝑓 + 𝑡) = (𝑔 + ℎ) ↔ (ℎ + 𝑔) = (𝑡 + 𝑓))
23	12, 22	syl6bb 289	. . . . 5 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
24	1	ecopoveq 8400	. . . . . 6 ⊢ (((ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆) ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆)) → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
25	24	ancoms 461	. . . . 5 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
26	23, 25	bitr4d 284	. . . 4 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩))
27	5, 8, 11, 26	2optocl 5648	. . 3 ⊢ ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)) → (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴))
28	4, 27	syl 17	. 2 ⊢ (𝐴 ∼ 𝐵 → (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴))
29	28	ibi 269	1 ⊢ (𝐴 ∼ 𝐵 → 𝐵 ∼ 𝐴)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537  ∃wex 1780   ∈ wcel 2114  ⟨cop 4575   class class class wbr 5068  {copab 5130   × cxp 5555  (class class class)co 7158

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-xp 5563  df-iota 6316  df-fv 6365  df-ov 7161

This theorem is referenced by:  ecopover  8403