Theorem ecopover 6527

Description: Assuming that operation 𝐹 is commutative (second hypothesis), closed (third hypothesis), associative (fourth hypothesis), and has the cancellation property (fifth hypothesis), show that the relation ∼, specified by the first hypothesis, is an equivalence relation. (Contributed by NM, 16-Feb-1996.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

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

Assertion

Ref	Expression
ecopover	⊢ ∼ Er (𝑆 × 𝑆)

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

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

Proof of Theorem ecopover

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

Step	Hyp	Ref	Expression
1		ecopopr.1	. . . . 5 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))}
2	1	relopabi 4665	. . . 4 ⊢ Rel ∼
3	2	a1i 9	. . 3 ⊢ (⊤ → Rel ∼ )
4		ecopopr.com	. . . . 5 ⊢ (𝑥 + 𝑦) = (𝑦 + 𝑥)
5	1, 4	ecopovsym 6525	. . . 4 ⊢ (𝑓 ∼ 𝑔 → 𝑔 ∼ 𝑓)
6	5	adantl 275	. . 3 ⊢ ((⊤ ∧ 𝑓 ∼ 𝑔) → 𝑔 ∼ 𝑓)
7		ecopopr.cl	. . . . 5 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
8		ecopopr.ass	. . . . 5 ⊢ ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))
9		ecopopr.can	. . . . 5 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) = (𝑥 + 𝑧) → 𝑦 = 𝑧))
10	1, 4, 7, 8, 9	ecopovtrn 6526	. . . 4 ⊢ ((𝑓 ∼ 𝑔 ∧ 𝑔 ∼ ℎ) → 𝑓 ∼ ℎ)
11	10	adantl 275	. . 3 ⊢ ((⊤ ∧ (𝑓 ∼ 𝑔 ∧ 𝑔 ∼ ℎ)) → 𝑓 ∼ ℎ)
12		vex 2689	. . . . . . . . . . 11 ⊢ 𝑔 ∈ V
13		vex 2689	. . . . . . . . . . 11 ⊢ ℎ ∈ V
14	12, 13, 4	caovcom 5928	. . . . . . . . . 10 ⊢ (𝑔 + ℎ) = (ℎ + 𝑔)
15	1	ecopoveq 6524	. . . . . . . . . 10 ⊢ (((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆)) → (⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩ ↔ (𝑔 + ℎ) = (ℎ + 𝑔)))
16	14, 15	mpbiri 167	. . . . . . . . 9 ⊢ (((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆)) → ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩)
17	16	anidms 394	. . . . . . . 8 ⊢ ((𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆) → ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩)
18	17	rgen2a 2486	. . . . . . 7 ⊢ ∀𝑔 ∈ 𝑆 ∀ℎ ∈ 𝑆 ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩
19		breq12 3934	. . . . . . . . 9 ⊢ ((𝑓 = ⟨𝑔, ℎ⟩ ∧ 𝑓 = ⟨𝑔, ℎ⟩) → (𝑓 ∼ 𝑓 ↔ ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩))
20	19	anidms 394	. . . . . . . 8 ⊢ (𝑓 = ⟨𝑔, ℎ⟩ → (𝑓 ∼ 𝑓 ↔ ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩))
21	20	ralxp 4682	. . . . . . 7 ⊢ (∀𝑓 ∈ (𝑆 × 𝑆)𝑓 ∼ 𝑓 ↔ ∀𝑔 ∈ 𝑆 ∀ℎ ∈ 𝑆 ⟨𝑔, ℎ⟩ ∼ ⟨𝑔, ℎ⟩)
22	18, 21	mpbir 145	. . . . . 6 ⊢ ∀𝑓 ∈ (𝑆 × 𝑆)𝑓 ∼ 𝑓
23	22	rspec 2484	. . . . 5 ⊢ (𝑓 ∈ (𝑆 × 𝑆) → 𝑓 ∼ 𝑓)
24	23	a1i 9	. . . 4 ⊢ (⊤ → (𝑓 ∈ (𝑆 × 𝑆) → 𝑓 ∼ 𝑓))
25		opabssxp 4613	. . . . . . 7 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 + 𝑢) = (𝑤 + 𝑣)))} ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
26	1, 25	eqsstri 3129	. . . . . 6 ⊢ ∼ ⊆ ((𝑆 × 𝑆) × (𝑆 × 𝑆))
27	26	ssbri 3972	. . . . 5 ⊢ (𝑓 ∼ 𝑓 → 𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓)
28		brxp 4570	. . . . . 6 ⊢ (𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓 ↔ (𝑓 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆)))
29	28	simplbi 272	. . . . 5 ⊢ (𝑓((𝑆 × 𝑆) × (𝑆 × 𝑆))𝑓 → 𝑓 ∈ (𝑆 × 𝑆))
30	27, 29	syl 14	. . . 4 ⊢ (𝑓 ∼ 𝑓 → 𝑓 ∈ (𝑆 × 𝑆))
31	24, 30	impbid1 141	. . 3 ⊢ (⊤ → (𝑓 ∈ (𝑆 × 𝑆) ↔ 𝑓 ∼ 𝑓))
32	3, 6, 11, 31	iserd 6455	. 2 ⊢ (⊤ → ∼ Er (𝑆 × 𝑆))
33	32	mptru 1340	1 ⊢ ∼ Er (𝑆 × 𝑆)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331  ⊤wtru 1332  ∃wex 1468   ∈ wcel 1480  ∀wral 2416  ⟨cop 3530   class class class wbr 3929  {copab 3988   × cxp 4537  Rel wrel 4544  (class class class)co 5774   Er wer 6426

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fv 5131  df-ov 5777  df-er 6429

This theorem is referenced by: (None)