Theorem eceqoveq 8820

Description: Equality of equivalence relation in terms of an operation. (Contributed by NM, 15-Feb-1996.) (Proof shortened by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
eceqoveq.5	⊢ ∼ Er (𝑆 × 𝑆)
eceqoveq.7	⊢ dom + = (𝑆 × 𝑆)
eceqoveq.8	⊢ ¬ ∅ ∈ 𝑆
eceqoveq.9	⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
eceqoveq.10	⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (⟨𝐴, 𝐵⟩ ∼ ⟨𝐶, 𝐷⟩ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))

Assertion

Ref	Expression
eceqoveq	⊢ ((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))

Distinct variable groups:   𝑥,𝑦, +   𝑥,𝑆,𝑦   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦

Allowed substitution hints:   ∼ (𝑥,𝑦)

Proof of Theorem eceqoveq

Step	Hyp	Ref	Expression
1		opelxpi 5699	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆))
2	1	ad2antrr 738	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → ⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆))
3		eceqoveq.5	. . . . . . . . 9 ⊢ ∼ Er (𝑆 × 𝑆)
4	3	a1i 11	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → ∼ Er (𝑆 × 𝑆))
5		simpr 489	. . . . . . . 8 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
6	4, 5	ereldm 8748	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ ⟨𝐶, 𝐷⟩ ∈ (𝑆 × 𝑆)))
7	2, 6	mpbid 235	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → ⟨𝐶, 𝐷⟩ ∈ (𝑆 × 𝑆))
8		opelxp2 5705	. . . . . 6 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝑆 × 𝑆) → 𝐷 ∈ 𝑆)
9	7, 8	syl 18	. . . . 5 ⊢ ((((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) ∧ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → 𝐷 ∈ 𝑆)
10	9	ex 417	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → 𝐷 ∈ 𝑆))
11		eceqoveq.9	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 + 𝑦) ∈ 𝑆)
12	11	caovcl 7605	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐵 + 𝐶) ∈ 𝑆)
13		eleq1 2857	. . . . . . 7 ⊢ ((𝐴 + 𝐷) = (𝐵 + 𝐶) → ((𝐴 + 𝐷) ∈ 𝑆 ↔ (𝐵 + 𝐶) ∈ 𝑆))
14	12, 13	imbitrrid 249	. . . . . 6 ⊢ ((𝐴 + 𝐷) = (𝐵 + 𝐶) → ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴 + 𝐷) ∈ 𝑆))
15		eceqoveq.7	. . . . . . . 8 ⊢ dom + = (𝑆 × 𝑆)
16		eceqoveq.8	. . . . . . . 8 ⊢ ¬ ∅ ∈ 𝑆
17	15, 16	ndmovrcl 7597	. . . . . . 7 ⊢ ((𝐴 + 𝐷) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆))
18	17	simprd 500	. . . . . 6 ⊢ ((𝐴 + 𝐷) ∈ 𝑆 → 𝐷 ∈ 𝑆)
19	14, 18	syl6com 38	. . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴 + 𝐷) = (𝐵 + 𝐶) → 𝐷 ∈ 𝑆))
20	19	adantll 726	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) → ((𝐴 + 𝐷) = (𝐵 + 𝐶) → 𝐷 ∈ 𝑆))
21	3	a1i 11	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ∼ Er (𝑆 × 𝑆))
22	1	adantr 485	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆))
23	21, 22	erth 8749	. . . . . 6 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (⟨𝐴, 𝐵⟩ ∼ ⟨𝐶, 𝐷⟩ ↔ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ))
24		eceqoveq.10	. . . . . 6 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (⟨𝐴, 𝐵⟩ ∼ ⟨𝐶, 𝐷⟩ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))
25	23, 24	bitr3d 284	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))
26	25	expr 461	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) → (𝐷 ∈ 𝑆 → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶))))
27	10, 20, 26	pm5.21ndd 382	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ 𝐶 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))
28	27	an32s 664	. 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ 𝐵 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))
29		eqcom 2776	. . . 4 ⊢ (∅ = [⟨𝐶, 𝐷⟩] ∼ ↔ [⟨𝐶, 𝐷⟩] ∼ = ∅)
30		erdm 8705	. . . . . . . . . . . 12 ⊢ ( ∼ Er (𝑆 × 𝑆) → dom ∼ = (𝑆 × 𝑆))
31	3, 30	ax-mp 5	. . . . . . . . . . 11 ⊢ dom ∼ = (𝑆 × 𝑆)
32	31	eleq2i 2861	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ ∈ dom ∼ ↔ ⟨𝐶, 𝐷⟩ ∈ (𝑆 × 𝑆))
33		ecdmn0 8747	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ ∈ dom ∼ ↔ [⟨𝐶, 𝐷⟩] ∼ ≠ ∅)
34		opelxp 5698	. . . . . . . . . 10 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝑆 × 𝑆) ↔ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆))
35	32, 33, 34	3bitr3i 304	. . . . . . . . 9 ⊢ ([⟨𝐶, 𝐷⟩] ∼ ≠ ∅ ↔ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆))
36	35	simplbi2 505	. . . . . . . 8 ⊢ (𝐶 ∈ 𝑆 → (𝐷 ∈ 𝑆 → [⟨𝐶, 𝐷⟩] ∼ ≠ ∅))
37	36	ad2antlr 739	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → (𝐷 ∈ 𝑆 → [⟨𝐶, 𝐷⟩] ∼ ≠ ∅))
38	37	necon2bd 2980	. . . . . 6 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐶, 𝐷⟩] ∼ = ∅ → ¬ 𝐷 ∈ 𝑆))
39		simpr 489	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆) → 𝐷 ∈ 𝑆)
40	15	ndmov 7595	. . . . . . 7 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆) → (𝐴 + 𝐷) = ∅)
41	39, 40	nsyl5 160	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝑆 → (𝐴 + 𝐷) = ∅)
42	38, 41	syl6 36	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐶, 𝐷⟩] ∼ = ∅ → (𝐴 + 𝐷) = ∅))
43		eleq1 2857	. . . . . . 7 ⊢ ((𝐴 + 𝐷) = ∅ → ((𝐴 + 𝐷) ∈ 𝑆 ↔ ∅ ∈ 𝑆))
44	16, 43	mtbiri 330	. . . . . 6 ⊢ ((𝐴 + 𝐷) = ∅ → ¬ (𝐴 + 𝐷) ∈ 𝑆)
45	35	simprbi 502	. . . . . . . 8 ⊢ ([⟨𝐶, 𝐷⟩] ∼ ≠ ∅ → 𝐷 ∈ 𝑆)
46	11	caovcl 7605	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆) → (𝐴 + 𝐷) ∈ 𝑆)
47	46	ex 417	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑆 → (𝐷 ∈ 𝑆 → (𝐴 + 𝐷) ∈ 𝑆))
48	47	ad2antrr 738	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → (𝐷 ∈ 𝑆 → (𝐴 + 𝐷) ∈ 𝑆))
49	45, 48	syl5 35	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐶, 𝐷⟩] ∼ ≠ ∅ → (𝐴 + 𝐷) ∈ 𝑆))
50	49	necon1bd 2982	. . . . . 6 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → (¬ (𝐴 + 𝐷) ∈ 𝑆 → [⟨𝐶, 𝐷⟩] ∼ = ∅))
51	44, 50	syl5 35	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ((𝐴 + 𝐷) = ∅ → [⟨𝐶, 𝐷⟩] ∼ = ∅))
52	42, 51	impbid 215	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐶, 𝐷⟩] ∼ = ∅ ↔ (𝐴 + 𝐷) = ∅))
53	29, 52	bitrid 286	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → (∅ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = ∅))
54	31	eleq2i 2861	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom ∼ ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆))
55		ecdmn0 8747	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom ∼ ↔ [⟨𝐴, 𝐵⟩] ∼ ≠ ∅)
56		opelxp 5698	. . . . . . . 8 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
57	54, 55, 56	3bitr3i 304	. . . . . . 7 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ≠ ∅ ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
58	57	simprbi 502	. . . . . 6 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ≠ ∅ → 𝐵 ∈ 𝑆)
59	58	necon1bi 2992	. . . . 5 ⊢ (¬ 𝐵 ∈ 𝑆 → [⟨𝐴, 𝐵⟩] ∼ = ∅)
60	59	adantl 486	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → [⟨𝐴, 𝐵⟩] ∼ = ∅)
61	60	eqeq1d 2771	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ ∅ = [⟨𝐶, 𝐷⟩] ∼ ))
62		simpl 487	. . . . . 6 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → 𝐵 ∈ 𝑆)
63	15	ndmov 7595	. . . . . 6 ⊢ (¬ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐵 + 𝐶) = ∅)
64	62, 63	nsyl5 160	. . . . 5 ⊢ (¬ 𝐵 ∈ 𝑆 → (𝐵 + 𝐶) = ∅)
65	64	adantl 486	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → (𝐵 + 𝐶) = ∅)
66	65	eqeq2d 2780	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ((𝐴 + 𝐷) = (𝐵 + 𝐶) ↔ (𝐴 + 𝐷) = ∅))
67	53, 61, 66	3bitr4d 314	. 2 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) ∧ ¬ 𝐵 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))
68	28, 67	pm2.61dan 824	1 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) = (𝐵 + 𝐶)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149   ≠ wne 2964  ∅c0 4294  ⟨cop 4600   class class class wbr 5113   × cxp 5660  dom cdm 5662  (class class class)co 7411   Er wer 8691  [cec 8692

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fv 6545  df-ov 7414  df-er 8694  df-ec 8696

This theorem is referenced by: (None)