| 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 8826. (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 6034 | . 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾ 𝐴) ∈ V) | |
| 2 | ecelqs 8826 | . 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 2147 Vcvv 3454 ↾ cres 5660 [cec 8753 / cqs 8754 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 ax-un 7783 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-xp 5664 df-rel 5665 df-cnv 5666 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ec 8757 df-qs 8761 |
| This theorem is used by: ecelqsi 8828 qliftlem 8857 erov 8873 eroprf 8874 sylow2a 19884 sylow2blem1 19885 sylow2blem2 19886 cldsubg 24485 tgjustr 28993 |
| Copyright terms: Public domain | W3C validator |