Theorem th3qlem2 6632

Description: Lemma for Exercise 44 version of Theorem 3Q of [Enderton] p. 60, extended to operations on ordered pairs. The fourth hypothesis is the compatibility assumption. (Contributed by NM, 4-Aug-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
th3q.1	⊢ ∼ ∈ V
th3q.2	⊢ ∼ Er (𝑆 × 𝑆)
th3q.4	⊢ ((((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) ∧ ((𝑠 ∈ 𝑆 ∧ 𝑓 ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆))) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)))

Assertion

Ref	Expression
th3qlem2	⊢ ((𝐴 ∈ ((𝑆 × 𝑆) / ∼ ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / ∼ )) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ))

Distinct variable groups:   𝑧,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,ℎ, ∼   𝑧,𝑆,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,ℎ   𝑧,𝐴,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓   𝑧,𝐵,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓   𝑧, + ,𝑤,𝑣,𝑢,𝑡,𝑠,𝑓,𝑔,ℎ

Allowed substitution hints:   𝐴(𝑔,ℎ)   𝐵(𝑔,ℎ)

Proof of Theorem th3qlem2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		th3q.2	. . 3 ⊢ ∼ Er (𝑆 × 𝑆)
2		eqid 2177	. . . . 5 ⊢ (𝑆 × 𝑆) = (𝑆 × 𝑆)
3		breq1 4003	. . . . . . . 8 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → (⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ↔ 𝑠 ∼ ⟨𝑢, 𝑡⟩))
4	3	anbi1d 465	. . . . . . 7 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) ↔ (𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦)))
5		oveq1 5876	. . . . . . . 8 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → (⟨𝑤, 𝑣⟩ + 𝑥) = (𝑠 + 𝑥))
6	5	breq1d 4010	. . . . . . 7 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → ((⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦) ↔ (𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)))
7	4, 6	imbi12d 234	. . . . . 6 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → (((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)) ↔ ((𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))))
8	7	imbi2d 230	. . . . 5 ⊢ (⟨𝑤, 𝑣⟩ = 𝑠 → (((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))) ↔ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)))))
9		breq2 4004	. . . . . . . 8 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → (𝑠 ∼ ⟨𝑢, 𝑡⟩ ↔ 𝑠 ∼ 𝑓))
10	9	anbi1d 465	. . . . . . 7 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → ((𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) ↔ (𝑠 ∼ 𝑓 ∧ 𝑥 ∼ 𝑦)))
11		oveq1 5876	. . . . . . . 8 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → (⟨𝑢, 𝑡⟩ + 𝑦) = (𝑓 + 𝑦))
12	11	breq2d 4012	. . . . . . 7 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → ((𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦) ↔ (𝑠 + 𝑥) ∼ (𝑓 + 𝑦)))
13	10, 12	imbi12d 234	. . . . . 6 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → (((𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)) ↔ ((𝑠 ∼ 𝑓 ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (𝑓 + 𝑦))))
14	13	imbi2d 230	. . . . 5 ⊢ (⟨𝑢, 𝑡⟩ = 𝑓 → (((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))) ↔ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 ∼ 𝑓 ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (𝑓 + 𝑦)))))
15		breq1 4003	. . . . . . . . . 10 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → (⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩ ↔ 𝑥 ∼ ⟨𝑔, ℎ⟩))
16	15	anbi2d 464	. . . . . . . . 9 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) ↔ (⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩)))
17		oveq2 5877	. . . . . . . . . 10 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) = (⟨𝑤, 𝑣⟩ + 𝑥))
18	17	breq1d 4010	. . . . . . . . 9 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → ((⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩) ↔ (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)))
19	16, 18	imbi12d 234	. . . . . . . 8 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → (((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)) ↔ ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩))))
20	19	imbi2d 230	. . . . . . 7 ⊢ (⟨𝑠, 𝑓⟩ = 𝑥 → ((((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩))) ↔ (((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)))))
21		breq2 4004	. . . . . . . . . 10 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → (𝑥 ∼ ⟨𝑔, ℎ⟩ ↔ 𝑥 ∼ 𝑦))
22	21	anbi2d 464	. . . . . . . . 9 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩) ↔ (⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦)))
23		oveq2 5877	. . . . . . . . . 10 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩) = (⟨𝑢, 𝑡⟩ + 𝑦))
24	23	breq2d 4012	. . . . . . . . 9 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → ((⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩) ↔ (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)))
25	22, 24	imbi12d 234	. . . . . . . 8 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → (((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)) ↔ ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))))
26	25	imbi2d 230	. . . . . . 7 ⊢ (⟨𝑔, ℎ⟩ = 𝑦 → ((((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩))) ↔ (((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦)))))
27		th3q.4	. . . . . . . 8 ⊢ ((((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) ∧ ((𝑠 ∈ 𝑆 ∧ 𝑓 ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆))) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩)))
28	27	expcom 116	. . . . . . 7 ⊢ (((𝑠 ∈ 𝑆 ∧ 𝑓 ∈ 𝑆) ∧ (𝑔 ∈ 𝑆 ∧ ℎ ∈ 𝑆)) → (((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ ⟨𝑠, 𝑓⟩ ∼ ⟨𝑔, ℎ⟩) → (⟨𝑤, 𝑣⟩ + ⟨𝑠, 𝑓⟩) ∼ (⟨𝑢, 𝑡⟩ + ⟨𝑔, ℎ⟩))))
29	2, 20, 26, 28	2optocl 4700	. . . . . 6 ⊢ ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → (((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))))
30	29	com12 30	. . . . 5 ⊢ (((𝑤 ∈ 𝑆 ∧ 𝑣 ∈ 𝑆) ∧ (𝑢 ∈ 𝑆 ∧ 𝑡 ∈ 𝑆)) → ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((⟨𝑤, 𝑣⟩ ∼ ⟨𝑢, 𝑡⟩ ∧ 𝑥 ∼ 𝑦) → (⟨𝑤, 𝑣⟩ + 𝑥) ∼ (⟨𝑢, 𝑡⟩ + 𝑦))))
31	2, 8, 14, 30	2optocl 4700	. . . 4 ⊢ ((𝑠 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆)) → ((𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆)) → ((𝑠 ∼ 𝑓 ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (𝑓 + 𝑦))))
32	31	imp 124	. . 3 ⊢ (((𝑠 ∈ (𝑆 × 𝑆) ∧ 𝑓 ∈ (𝑆 × 𝑆)) ∧ (𝑥 ∈ (𝑆 × 𝑆) ∧ 𝑦 ∈ (𝑆 × 𝑆))) → ((𝑠 ∼ 𝑓 ∧ 𝑥 ∼ 𝑦) → (𝑠 + 𝑥) ∼ (𝑓 + 𝑦)))
33	1, 32	th3qlem1 6631	. 2 ⊢ ((𝐴 ∈ ((𝑆 × 𝑆) / ∼ ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / ∼ )) → ∃*𝑧∃𝑠∃𝑥((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ))
34		vex 2740	. . . . . . 7 ⊢ 𝑤 ∈ V
35		vex 2740	. . . . . . 7 ⊢ 𝑣 ∈ V
36	34, 35	opex 4226	. . . . . 6 ⊢ ⟨𝑤, 𝑣⟩ ∈ V
37		vex 2740	. . . . . . 7 ⊢ 𝑢 ∈ V
38		vex 2740	. . . . . . 7 ⊢ 𝑡 ∈ V
39	37, 38	opex 4226	. . . . . 6 ⊢ ⟨𝑢, 𝑡⟩ ∈ V
40		eceq1 6564	. . . . . . . . 9 ⊢ (𝑠 = ⟨𝑤, 𝑣⟩ → [𝑠] ∼ = [⟨𝑤, 𝑣⟩] ∼ )
41	40	eqeq2d 2189	. . . . . . . 8 ⊢ (𝑠 = ⟨𝑤, 𝑣⟩ → (𝐴 = [𝑠] ∼ ↔ 𝐴 = [⟨𝑤, 𝑣⟩] ∼ ))
42		eceq1 6564	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑢, 𝑡⟩ → [𝑥] ∼ = [⟨𝑢, 𝑡⟩] ∼ )
43	42	eqeq2d 2189	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑢, 𝑡⟩ → (𝐵 = [𝑥] ∼ ↔ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ))
44	41, 43	bi2anan9 606	. . . . . . 7 ⊢ ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → ((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ↔ (𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ )))
45		oveq12 5878	. . . . . . . . 9 ⊢ ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (𝑠 + 𝑥) = (⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩))
46	45	eceq1d 6565	. . . . . . . 8 ⊢ ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → [(𝑠 + 𝑥)] ∼ = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ )
47	46	eqeq2d 2189	. . . . . . 7 ⊢ ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (𝑧 = [(𝑠 + 𝑥)] ∼ ↔ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ))
48	44, 47	anbi12d 473	. . . . . 6 ⊢ ((𝑠 = ⟨𝑤, 𝑣⟩ ∧ 𝑥 = ⟨𝑢, 𝑡⟩) → (((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ) ↔ ((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ )))
49	36, 39, 48	spc2ev 2833	. . . . 5 ⊢ (((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ) → ∃𝑠∃𝑥((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ))
50	49	exlimivv 1896	. . . 4 ⊢ (∃𝑢∃𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ) → ∃𝑠∃𝑥((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ))
51	50	exlimivv 1896	. . 3 ⊢ (∃𝑤∃𝑣∃𝑢∃𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ) → ∃𝑠∃𝑥((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ))
52	51	moimi 2091	. 2 ⊢ (∃*𝑧∃𝑠∃𝑥((𝐴 = [𝑠] ∼ ∧ 𝐵 = [𝑥] ∼ ) ∧ 𝑧 = [(𝑠 + 𝑥)] ∼ ) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ))
53	33, 52	syl 14	1 ⊢ ((𝐴 ∈ ((𝑆 × 𝑆) / ∼ ) ∧ 𝐵 ∈ ((𝑆 × 𝑆) / ∼ )) → ∃*𝑧∃𝑤∃𝑣∃𝑢∃𝑡((𝐴 = [⟨𝑤, 𝑣⟩] ∼ ∧ 𝐵 = [⟨𝑢, 𝑡⟩] ∼ ) ∧ 𝑧 = [(⟨𝑤, 𝑣⟩ + ⟨𝑢, 𝑡⟩)] ∼ ))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1353  ∃wex 1492  ∃*wmo 2027   ∈ wcel 2148  Vcvv 2737  ⟨cop 3594   class class class wbr 4000   × cxp 4621  (class class class)co 5869   Er wer 6526  [cec 6527   / cqs 6528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fv 5220  df-ov 5872  df-er 6529  df-ec 6531  df-qs 6535

This theorem is referenced by:  th3qcor  6633  th3q  6634