![]() |
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 5710 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → 〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴)) | |
2 | ecopqsi.1 | . . . 4 ⊢ 𝑅 ∈ V | |
3 | 2 | ecelqsi 8792 | . . 3 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ ((𝐴 × 𝐴) / 𝑅)) |
4 | ecopqsi.2 | . . 3 ⊢ 𝑆 = ((𝐴 × 𝐴) / 𝑅) | |
5 | 3, 4 | eleqtrrdi 2837 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ 𝑆) |
6 | 1, 5 | syl 17 | 1 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → [〈𝐵, 𝐶〉]𝑅 ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1534 ∈ wcel 2099 Vcvv 3463 〈cop 4630 × cxp 5671 [cec 8722 / cqs 8723 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2697 ax-sep 5295 ax-nul 5302 ax-pr 5424 ax-un 7736 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-ral 3052 df-rex 3061 df-rab 3421 df-v 3465 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4525 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4907 df-br 5145 df-opab 5207 df-xp 5679 df-cnv 5681 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-ec 8726 df-qs 8730 |
This theorem is referenced by: brecop 8829 recexsrlem 11135 |
Copyright terms: Public domain | W3C validator |