| 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 8749. (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 6013 | . 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾ 𝐴) ∈ V) | |
| 2 | ecelqs 8749 | . 2 ⊢ (((𝑅 ↾ 𝐴) ∈ V ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) | |
| 3 | 1, 2 | sylan 589 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2142 Vcvv 3454 ↾ cres 5649 [cec 8676 / cqs 8677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-xp 5653 df-rel 5654 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-ec 8680 df-qs 8684 |
| This theorem is referenced by: ecelqsi 8751 qliftlem 8780 erov 8796 eroprf 8797 sylow2a 19659 sylow2blem1 19660 sylow2blem2 19661 cldsubg 24168 tgjustr 28640 |
| Copyright terms: Public domain | W3C validator |