Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ecopqsi | Structured version Visualization version GIF version |
Description: "Closure" law for equivalence class of ordered pairs. (Contributed by NM, 25-Mar-1996.) |
Ref | Expression |
---|---|
ecopqsi.1 | ⊢ 𝑅 ∈ V |
ecopqsi.2 | ⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅) |
Ref | Expression |
---|---|
ecopqsi | ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelxpi 5617 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → 〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴)) | |
2 | ecopqsi.1 | . . . 4 ⊢ 𝑅 ∈ V | |
3 | 2 | ecelqsi 8520 | . . 3 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ ((𝐴 × 𝐴) / 𝑅)) |
4 | ecopqsi.2 | . . 3 ⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅) | |
5 | 3, 4 | eleqtrrdi 2850 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ 𝑆) |
6 | 1, 5 | syl 17 | 1 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 〈cop 4564 × cxp 5578 [cec 8454 / cqs 8455 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-xp 5586 df-cnv 5588 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-ec 8458 df-qs 8462 |
This theorem is referenced by: brecop 8557 recexsrlem 10790 |
Copyright terms: Public domain | W3C validator |