Theorem ecopqsi 8813

Description: "Closure" law for equivalence class of ordered pairs. (Contributed by NM, 25-Mar-1996.)

Hypotheses

Ref	Expression
ecopqsi.1	⊢ 𝑅 ∈ V
ecopqsi.2	⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅)

Assertion

Ref	Expression
ecopqsi	⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ 𝑆)

Proof of Theorem ecopqsi

Step	Hyp	Ref	Expression
1		opelxpi 5726	. 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴))
2		ecopqsi.1	. . . 4 ⊢ 𝑅 ∈ V
3	2	ecelqsi 8812	. . 3 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ ((𝐴 × 𝐴) / 𝑅))
4		ecopqsi.2	. . 3 ⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅)
5	3, 4	eleqtrrdi 2850	. 2 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ 𝑆)
6	1, 5	syl 17	1 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ 𝑆)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  Vcvv 3478  ⟨cop 4637   × cxp 5687  [cec 8742   / cqs 8743

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-xp 5695  df-cnv 5697  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ec 8746  df-qs 8750

This theorem is referenced by:  brecop  8849  recexsrlem  11141