| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ecelqsw | Structured version Visualization version GIF version | ||
| Description: Membership of an equivalence class in a quotient set. More restrictive antecedent; kept for backward compatibility; for new work, prefer ecelqs 8788. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 9-Jul-2014.) (Proof shortened by AV, 25-Nov-2025.) |
| Ref | Expression |
|---|---|
| ecelqsw | ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resexg 6016 | . 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾ 𝐴) ∈ V) | |
| 2 | ecelqs 8788 | . 2 ⊢ (((𝑅 ↾ 𝐴) ∈ V ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) | |
| 3 | 1, 2 | sylan 592 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 Vcvv 3451 ↾ cres 5653 [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: ecelqsi 8790 qliftlem 8819 erov 8835 eroprf 8836 sylow2a 19833 sylow2blem1 19834 sylow2blem2 19835 cldsubg 24430 tgjustr 28936 |
| Copyright terms: Public domain | W3C validator |