Theorem brecop 8599

Description: Binary relation on a quotient set. Lemma for real number construction. (Contributed by NM, 29-Jan-1996.)

Hypotheses

Ref	Expression
brecop.1	⊢ ∼ ∈ V
brecop.2	⊢ ∼ Er (𝐺 × 𝐺)
brecop.4	⊢ 𝐻 = ((𝐺 × 𝐺) / ∼ )
brecop.5	⊢ ≤ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))}
brecop.6	⊢ ((((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺)) ∧ ((𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓)))

Assertion

Ref	Expression
brecop	⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ 𝜓))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐶,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐷,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥, ∼ ,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐻,𝑦   𝑧,𝐺,𝑤,𝑣,𝑢   𝜑,𝑥,𝑦   𝜓,𝑧,𝑤,𝑣,𝑢

Allowed substitution hints:   𝜑(𝑧,𝑤,𝑣,𝑢)   𝜓(𝑥,𝑦)   𝐺(𝑥,𝑦)   𝐻(𝑧,𝑤,𝑣,𝑢)   ≤ (𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem brecop

Step	Hyp	Ref	Expression
1		brecop.1	. . . 4 ⊢ ∼ ∈ V
2		brecop.4	. . . 4 ⊢ 𝐻 = ((𝐺 × 𝐺) / ∼ )
3	1, 2	ecopqsi 8563	. . 3 ⊢ ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → [⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻)
4	1, 2	ecopqsi 8563	. . 3 ⊢ ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻)
5		df-br 5075	. . . . 5 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ ≤ )
6		brecop.5	. . . . . 6 ⊢ ≤ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))}
7	6	eleq2i 2830	. . . . 5 ⊢ (⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ ≤ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))})
8	5, 7	bitri 274	. . . 4 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))})
9		eqeq1 2742	. . . . . . . 8 ⊢ (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (𝑥 = [⟨𝑧, 𝑤⟩] ∼ ↔ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ))
10	9	anbi1d 630	. . . . . . 7 ⊢ (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → ((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ )))
11	10	anbi1d 630	. . . . . 6 ⊢ (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
12	11	4exbidv 1929	. . . . 5 ⊢ (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
13		eqeq1 2742	. . . . . . . 8 ⊢ (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (𝑦 = [⟨𝑣, 𝑢⟩] ∼ ↔ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ))
14	13	anbi2d 629	. . . . . . 7 ⊢ (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ )))
15	14	anbi1d 630	. . . . . 6 ⊢ (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → ((([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
16	15	4exbidv 1929	. . . . 5 ⊢ (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
17	12, 16	opelopab2 5454	. . . 4 ⊢ (([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻) → (⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))} ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
18	8, 17	bitrid 282	. . 3 ⊢ (([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
19	3, 4, 18	syl2an 596	. 2 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
20		opeq12 4806	. . . . . 6 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → ⟨𝑧, 𝑤⟩ = ⟨𝐴, 𝐵⟩)
21	20	eceq1d 8537	. . . . 5 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
22		opeq12 4806	. . . . . 6 ⊢ ((𝑣 = 𝐶 ∧ 𝑢 = 𝐷) → ⟨𝑣, 𝑢⟩ = ⟨𝐶, 𝐷⟩)
23	22	eceq1d 8537	. . . . 5 ⊢ ((𝑣 = 𝐶 ∧ 𝑢 = 𝐷) → [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
24	21, 23	anim12i 613	. . . 4 ⊢ (((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) ∧ (𝑣 = 𝐶 ∧ 𝑢 = 𝐷)) → ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ))
25		opelxpi 5626	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺))
26		opelxp 5625	. . . . . . . . 9 ⊢ (⟨𝑧, 𝑤⟩ ∈ (𝐺 × 𝐺) ↔ (𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺))
27		brecop.2	. . . . . . . . . . 11 ⊢ ∼ Er (𝐺 × 𝐺)
28	27	a1i 11	. . . . . . . . . 10 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ∼ Er (𝐺 × 𝐺))
29		id 22	. . . . . . . . . 10 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
30	28, 29	ereldm 8546	. . . . . . . . 9 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → (⟨𝑧, 𝑤⟩ ∈ (𝐺 × 𝐺) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺)))
31	26, 30	bitr3id 285	. . . . . . . 8 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺)))
32	25, 31	syl5ibr 245	. . . . . . 7 ⊢ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → (𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺)))
33		opelxpi 5626	. . . . . . . 8 ⊢ ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺))
34		opelxp 5625	. . . . . . . . 9 ⊢ (⟨𝑣, 𝑢⟩ ∈ (𝐺 × 𝐺) ↔ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺))
35	27	a1i 11	. . . . . . . . . 10 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ∼ Er (𝐺 × 𝐺))
36		id 22	. . . . . . . . . 10 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
37	35, 36	ereldm 8546	. . . . . . . . 9 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → (⟨𝑣, 𝑢⟩ ∈ (𝐺 × 𝐺) ↔ ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺)))
38	34, 37	bitr3id 285	. . . . . . . 8 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ((𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺) ↔ ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺)))
39	33, 38	syl5ibr 245	. . . . . . 7 ⊢ ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)))
40	32, 39	im2anan9 620	. . . . . 6 ⊢ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺))))
41		brecop.6	. . . . . . . . 9 ⊢ ((((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺)) ∧ ((𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓)))
42	41	an4s 657	. . . . . . . 8 ⊢ ((((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) ∧ ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓)))
43	42	ex 413	. . . . . . 7 ⊢ (((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓))))
44	43	com13 88	. . . . . 6 ⊢ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) → (𝜑 ↔ 𝜓))))
45	40, 44	mpdd 43	. . . . 5 ⊢ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜑 ↔ 𝜓)))
46	45	pm5.74d 272	. . . 4 ⊢ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → ((((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑) ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
47	24, 46	cgsex4g 3476	. . 3 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑)) ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
48		eqcom 2745	. . . . . . 7 ⊢ ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ↔ [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
49		eqcom 2745	. . . . . . 7 ⊢ ([⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ↔ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
50	48, 49	anbi12i 627	. . . . . 6 ⊢ (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ))
51	50	a1i 11	. . . . 5 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )))
52		biimt 361	. . . . 5 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜑 ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑)))
53	51, 52	anbi12d 631	. . . 4 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ((([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑))))
54	53	4exbidv 1929	. . 3 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑))))
55		biimt 361	. . 3 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜓 ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
56	47, 54, 55	3bitr4d 311	. 2 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ 𝜓))
57	19, 56	bitrd 278	1 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106  Vcvv 3432  ⟨cop 4567   class class class wbr 5074  {copab 5136   × cxp 5587   Er wer 8495  [cec 8496   / cqs 8497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-er 8498  df-ec 8500  df-qs 8504

This theorem is referenced by:  ltsrpr  10833