Theorem brecop2 8800

Description: Binary relation on a quotient set. Lemma for real number construction. Eliminates antecedent from last hypothesis. (Contributed by NM, 13-Feb-1996.) (Revised by AV, 12-Jul-2022.)

Hypotheses

Ref	Expression
brecop2.1	⊢ dom ∼ = (𝐺 × 𝐺)
brecop2.2	⊢ 𝐻 = ((𝐺 × 𝐺) / ∼ )
brecop2.3	⊢ 𝑅 ⊆ (𝐻 × 𝐻)
brecop2.4	⊢ ≤ ⊆ (𝐺 × 𝐺)
brecop2.5	⊢ ¬ ∅ ∈ 𝐺
brecop2.6	⊢ dom + = (𝐺 × 𝐺)
brecop2.7	⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) ≤ (𝐵 + 𝐶)))

Assertion

Ref	Expression
brecop2	⊢ ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) ≤ (𝐵 + 𝐶))

Proof of Theorem brecop2

Step	Hyp	Ref	Expression
1		brecop2.3	. . . 4 ⊢ 𝑅 ⊆ (𝐻 × 𝐻)
2	1	brel 5731	. . 3 ⊢ ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ → ([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻))
3		brecop2.1	. . . . . . 7 ⊢ dom ∼ = (𝐺 × 𝐺)
4		ecelqsdm 8776	. . . . . . 7 ⊢ ((dom ∼ = (𝐺 × 𝐺) ∧ [⟨𝐴, 𝐵⟩] ∼ ∈ ((𝐺 × 𝐺) / ∼ )) → ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺))
5	3, 4	mpan 687	. . . . . 6 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ∈ ((𝐺 × 𝐺) / ∼ ) → ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺))
6		brecop2.2	. . . . . 6 ⊢ 𝐻 = ((𝐺 × 𝐺) / ∼ )
7	5, 6	eleq2s 2843	. . . . 5 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 → ⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺))
8		opelxp 5702	. . . . 5 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝐺 × 𝐺) ↔ (𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺))
9	7, 8	sylib 217	. . . 4 ⊢ ([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 → (𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺))
10		ecelqsdm 8776	. . . . . . 7 ⊢ ((dom ∼ = (𝐺 × 𝐺) ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ ((𝐺 × 𝐺) / ∼ )) → ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺))
11	3, 10	mpan 687	. . . . . 6 ⊢ ([⟨𝐶, 𝐷⟩] ∼ ∈ ((𝐺 × 𝐺) / ∼ ) → ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺))
12	11, 6	eleq2s 2843	. . . . 5 ⊢ ([⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻 → ⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺))
13		opelxp 5702	. . . . 5 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝐺 × 𝐺) ↔ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))
14	12, 13	sylib 217	. . . 4 ⊢ ([⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻 → (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))
15	9, 14	anim12i 612	. . 3 ⊢ (([⟨𝐴, 𝐵⟩] ∼ ∈ 𝐻 ∧ [⟨𝐶, 𝐷⟩] ∼ ∈ 𝐻) → ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)))
16	2, 15	syl 17	. 2 ⊢ ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ → ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)))
17		brecop2.4	. . . . 5 ⊢ ≤ ⊆ (𝐺 × 𝐺)
18	17	brel 5731	. . . 4 ⊢ ((𝐴 + 𝐷) ≤ (𝐵 + 𝐶) → ((𝐴 + 𝐷) ∈ 𝐺 ∧ (𝐵 + 𝐶) ∈ 𝐺))
19		brecop2.6	. . . . . 6 ⊢ dom + = (𝐺 × 𝐺)
20		brecop2.5	. . . . . 6 ⊢ ¬ ∅ ∈ 𝐺
21	19, 20	ndmovrcl 7586	. . . . 5 ⊢ ((𝐴 + 𝐷) ∈ 𝐺 → (𝐴 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺))
22	19, 20	ndmovrcl 7586	. . . . 5 ⊢ ((𝐵 + 𝐶) ∈ 𝐺 → (𝐵 ∈ 𝐺 ∧ 𝐶 ∈ 𝐺))
23	21, 22	anim12i 612	. . . 4 ⊢ (((𝐴 + 𝐷) ∈ 𝐺 ∧ (𝐵 + 𝐶) ∈ 𝐺) → ((𝐴 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) ∧ (𝐵 ∈ 𝐺 ∧ 𝐶 ∈ 𝐺)))
24	18, 23	syl 17	. . 3 ⊢ ((𝐴 + 𝐷) ≤ (𝐵 + 𝐶) → ((𝐴 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) ∧ (𝐵 ∈ 𝐺 ∧ 𝐶 ∈ 𝐺)))
25		an42 654	. . 3 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺) ∧ (𝐵 ∈ 𝐺 ∧ 𝐶 ∈ 𝐺)) ↔ ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)))
26	24, 25	sylib 217	. 2 ⊢ ((𝐴 + 𝐷) ≤ (𝐵 + 𝐶) → ((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)))
27		brecop2.7	. 2 ⊢ (((𝐴 ∈ 𝐺 ∧ 𝐵 ∈ 𝐺) ∧ (𝐶 ∈ 𝐺 ∧ 𝐷 ∈ 𝐺)) → ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) ≤ (𝐵 + 𝐶)))
28	16, 26, 27	pm5.21nii 378	1 ⊢ ([⟨𝐴, 𝐵⟩] ∼ 𝑅[⟨𝐶, 𝐷⟩] ∼ ↔ (𝐴 + 𝐷) ≤ (𝐵 + 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1533   ∈ wcel 2098   ⊆ wss 3940  ∅c0 4314  ⟨cop 4626   class class class wbr 5138   × cxp 5664  dom cdm 5666  (class class class)co 7401  [cec 8696   / cqs 8697

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-sep 5289  ax-nul 5296  ax-pr 5417

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-ne 2933  df-ral 3054  df-rex 3063  df-rab 3425  df-v 3468  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-br 5139  df-opab 5201  df-xp 5672  df-cnv 5674  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6485  df-fv 6541  df-ov 7404  df-ec 8700  df-qs 8704

This theorem is referenced by:  ltsrpr  11067