Theorem ecopovsym 8836

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 5764	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
3	1, 2	eqsstri 4007	. . . 4 ⊢ ∼ ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
4	3	brel 5737	. . 3 ⊢ (𝐴 ∼ 𝐵 → (𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)))
5		eqid 2725	. . . 4 ⊢ (𝑆 × 𝑆) = (𝑆 × 𝑆)
6		breq1 5146	. . . . 5 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ 𝐴 ∼ ⟨ℎ, 𝑡⟩))
7		breq2 5147	. . . . 5 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴))
8	6, 7	bibi12d 344	. . . 4 ⊢ (⟨𝑓, 𝑔⟩ = 𝐴 → ((⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩) ↔ (𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴)))
9		breq2 5147	. . . . 5 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → (𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ 𝐴 ∼ 𝐵))
10		breq1 5146	. . . . 5 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → (⟨ℎ, 𝑡⟩ ∼ 𝐴 ↔ 𝐵 ∼ 𝐴))
11	9, 10	bibi12d 344	. . . 4 ⊢ (⟨ℎ, 𝑡⟩ = 𝐵 → ((𝐴 ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ 𝐴) ↔ (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴)))
12	1	ecopoveq 8835	. . . . . 6 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ (𝑓 + 𝑡) = (𝑔 + ℎ)))
13		vex 3467	. . . . . . . . 9 ⊢ 𝑓 ∈ V
14		vex 3467	. . . . . . . . 9 ⊢ 𝑡 ∈ V
15		ecopopr.com	. . . . . . . . 9 ⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥)
16	13, 14, 15	caovcom 7615	. . . . . . . 8 ⊢ (𝑓 + 𝑡) = (𝑡 + 𝑓)
17		vex 3467	. . . . . . . . 9 ⊢ 𝑔 ∈ V
18		vex 3467	. . . . . . . . 9 ⊢ ℎ ∈ V
19	17, 18, 15	caovcom 7615	. . . . . . . 8 ⊢ (𝑔 + ℎ) = (ℎ + 𝑔)
20	16, 19	eqeq12i 2743	. . . . . . 7 ⊢ ((𝑓 + 𝑡) = (𝑔 + ℎ) ↔ (𝑡 + 𝑓) = (ℎ + 𝑔))
21		eqcom 2732	. . . . . . 7 ⊢ ((𝑡 + 𝑓) = (ℎ + 𝑔) ↔ (ℎ + 𝑔) = (𝑡 + 𝑓))
22	20, 21	bitri 274	. . . . . 6 ⊢ ((𝑓 + 𝑡) = (𝑔 + ℎ) ↔ (ℎ + 𝑔) = (𝑡 + 𝑓))
23	12, 22	bitrdi 286	. . . . 5 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
24	1	ecopoveq 8835	. . . . . 6 ⊢ (((ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆) ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆)) → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
25	24	ancoms 457	. . . . 5 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩ ↔ (ℎ + 𝑔) = (𝑡 + 𝑓)))
26	23, 25	bitr4d 281	. . . 4 ⊢ (((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ (ℎ ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → (⟨𝑓, 𝑔⟩ ∼ ⟨ℎ, 𝑡⟩ ↔ ⟨ℎ, 𝑡⟩ ∼ ⟨𝑓, 𝑔⟩))
27	5, 8, 11, 26	2optocl 5767	. . 3 ⊢ ((𝐴 ∈ (𝑆 × 𝑆) ∧ 𝐵 ∈ (𝑆 × 𝑆)) → (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴))
28	4, 27	syl 17	. 2 ⊢ (𝐴 ∼ 𝐵 → (𝐴 ∼ 𝐵 ↔ 𝐵 ∼ 𝐴))
29	28	ibi 266	1 ⊢ (𝐴 ∼ 𝐵 → 𝐵 ∼ 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533  ∃wex 1773   ∈ wcel 2098  ⟨cop 4630   class class class wbr 5143  {copab 5205   × cxp 5670  (class class class)co 7416

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-sep 5294  ax-nul 5301  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-ss 3956  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5144  df-opab 5206  df-xp 5678  df-iota 6495  df-fv 6551  df-ov 7419

This theorem is referenced by:  ecopover  8838