Theorem ecopqsi 8791

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 5688	. 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴))
2		ecopqsi.1	. . . 4 ⊢ 𝑅 ∈ V
3	2	ecelqsi 8790	. . 3 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ ((𝐴 × 𝐴) / 𝑅))
4		ecopqsi.2	. . 3 ⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅)
5	3, 4	eleqtrrdi 2872	. 2 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ 𝑆)
6	1, 5	syl 18	1 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590   × cxp 5649  [cec 8715   / cqs 8716

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ec 8719  df-qs 8723

This theorem is used by:  brecop  8831  recexsrlem  11188