ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brecop GIF version

Theorem brecop 6899
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
StepHypRef Expression
1 brecop.1 . . . 4 ∼ ∈ V
2 brecop.4 . . . 4 𝐻 = ((𝐺 × 𝐺) / ∼ )
31, 2ecopqsi 6864 . . 3 ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → [⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻)
41, 2ecopqsi 6864 . . 3 ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻)
5 df-br 4131 . . . . 5 ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ ≤ )
6 brecop.5 . . . . . 6 ≤ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))}
76eleq2i 2305 . . . . 5 (⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ ≤ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))})
85, 7bitri 184 . . . 4 ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))})
9 eqeq1 2245 . . . . . . . 8 (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (𝑥 = [⟨𝑧, 𝑤⟩] ∼ ↔ [⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ))
109anbi1d 469 . . . . . . 7 (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → ((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ )))
1110anbi1d 469 . . . . . 6 (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
12114exbidv 1923 . . . . 5 (𝑥 = [⟨𝐴, 𝐵⟩] ∼ → (∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
13 eqeq1 2245 . . . . . . . 8 (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (𝑦 = [⟨𝑣, 𝑢⟩] ∼ ↔ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ))
1413anbi2d 468 . . . . . . 7 (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ )))
1514anbi1d 469 . . . . . 6 (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → ((([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
16154exbidv 1923 . . . . 5 (𝑦 = [⟨𝐶, 𝐷⟩] ∼ → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
1712, 16opelopab2 4413 . . . 4 (([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻) → (⟨[⟨𝐴, 𝐵⟩] ∼ , [⟨𝐶, 𝐷⟩] ∼ ⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = [⟨𝑧, 𝑤⟩] ∼ ∧ 𝑦 = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑))} ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
188, 17bitrid 192 . . 3 (([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
193, 4, 18syl2an 289 . 2 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑)))
20 opeq12 3906 . . . . . 6 ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → ⟨𝑧, 𝑤⟩ = ⟨𝐴, 𝐵⟩)
2120eceq1d 6843 . . . . 5 ((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) → [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
22 opeq12 3906 . . . . . 6 ((𝑣 = 𝐶 ∧ 𝑢 = 𝐷) → ⟨𝑣, 𝑢⟩ = ⟨𝐶, 𝐷⟩)
2322eceq1d 6843 . . . . 5 ((𝑣 = 𝐶 ∧ 𝑢 = 𝐷) → [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
2421, 23anim12i 338 . . . 4 (((𝑧 = 𝐴 ∧ 𝑤 = 𝐵) ∧ (𝑣 = 𝐶 ∧ 𝑢 = 𝐷)) → ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ))
25 opelxpi 4806 . . . . . . . 8 ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺))
26 opelxp 4804 . . . . . . . . 9 (⟨𝑧, 𝑤⟩ ∈ (𝐺 × 𝐺) ↔ (𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺))
27 brecop.2 . . . . . . . . . . 11 ∼ Er (𝐺 × 𝐺)
2827a1i 9 . . . . . . . . . 10 ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ∼ Er (𝐺 × 𝐺))
29 id 19 . . . . . . . . . 10 ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
3028, 29ereldm 6852 . . . . . . . . 9 ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → (⟨𝑧, 𝑤⟩ ∈ (𝐺 × 𝐺) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺)))
3126, 30bitr3id 194 . . . . . . . 8 ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺)))
3225, 31imbitrrid 156 . . . . . . 7 ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ → ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) → (𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺)))
33 opelxpi 4806 . . . . . . . 8 ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺))
34 opelxp 4804 . . . . . . . . 9 (⟨𝑣, 𝑢⟩ ∈ (𝐺 × 𝐺) ↔ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺))
3527a1i 9 . . . . . . . . . 10 ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ∼ Er (𝐺 × 𝐺))
36 id 19 . . . . . . . . . 10 ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
3735, 36ereldm 6852 . . . . . . . . 9 ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → (⟨𝑣, 𝑢⟩ ∈ (𝐺 × 𝐺) ↔ ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺)))
3834, 37bitr3id 194 . . . . . . . 8 ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ((𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺) ↔ ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺)))
3933, 38imbitrrid 156 . . . . . . 7 ([⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ → ((𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) → (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)))
4032, 39im2anan9 606 . . . . . 6 (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺))))
41 brecop.6 . . . . . . . . 9 ((((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺)) ∧ ((𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓)))
4241an4s 596 . . . . . . . 8 ((((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) ∧ ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓)))
4342ex 115 . . . . . . 7 (((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (𝜑 ↔ 𝜓))))
4443com13 80 . . . . . 6 (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (((𝑧 ∈ 𝐺 ∧ 𝑤 ∈ 𝐺) ∧ (𝑣 ∈ 𝐺 ∧ 𝑢 ∈ 𝐺)) → (𝜑 ↔ 𝜓))))
4540, 44mpdd 41 . . . . 5 (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜑 ↔ 𝜓)))
4645pm5.74d 182 . . . 4 (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) → ((((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑) ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
4724, 46cgsex4g 2859 . . 3 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑)) ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
48 eqcom 2240 . . . . . . 7 ([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ↔ [⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ )
49 eqcom 2240 . . . . . . 7 ([⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ↔ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )
5048, 49anbi12i 464 . . . . . 6 (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ))
5150a1i 9 . . . . 5 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ↔ ([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ )))
52 biimt 241 . . . . 5 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜑 ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑)))
5351, 52anbi12d 477 . . . 4 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ((([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ (([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑))))
54534exbidv 1923 . . 3 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ ∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝑧, 𝑤⟩] ∼ = [⟨𝐴, 𝐵⟩] ∼ ∧ [⟨𝑣, 𝑢⟩] ∼ = [⟨𝐶, 𝐷⟩] ∼ ) ∧ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜑))))
55 biimt 241 . . 3 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (𝜓 ↔ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → 𝜓)))
5647, 54, 553bitr4d 220 . 2 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → (∃𝑧∃𝑤∃𝑣∃𝑢(([⟨𝐴, 𝐵⟩] ∼ = [⟨𝑧, 𝑤⟩] ∼ ∧ [⟨𝐶, 𝐷⟩] ∼ = [⟨𝑣, 𝑢⟩] ∼ ) ∧ 𝜑) ↔ 𝜓))
5719, 56bitrd 188 1 (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ ≤ [⟨𝐶, 𝐷⟩] ∼ ↔ 𝜓))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712   class class class wbr 4130  {copab 4191   × cxp 4772   Er wer 6804  [cec 6805   / cqs 6806
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-er 6807  df-ec 6809  df-qs 6813
This theorem is used by:  ordpipqqs  7742  ltsrprg  8115
  Copyright terms: Public domain W3C validator