| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relelec | Structured version Visualization version GIF version | ||
| Description: Membership in an equivalence class when 𝑅 is a relation. (Contributed by Mario Carneiro, 11-Sep-2015.) |
| Ref | Expression |
|---|---|
| relelec | ⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3479 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐴 ∈ V) | |
| 2 | ecexr 8708 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝐴 ∈ [𝐵]𝑅 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ [𝐵]𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 5 | brrelex12 5718 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 6 | 5 | ancomd 467 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | elecg 8748 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴)) | |
| 8 | 4, 6, 7 | pm5.21nd 814 | 1 ⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∈ wcel 2146 Vcvv 3458 class class class wbr 5114 Rel wrel 5671 [cec 8701 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 df-rel 5673 df-cnv 5674 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-ec 8705 |
| This theorem is used by: elecres 8752 eqgid 19279 eqg0el 19285 tgptsmscls 24344 pstmfval 34317 ismntop 34447 topfneec 36907 releleccnv 38950 elec1cnvres 38965 eleccnvep 38977 inecmo 39045 elecxrn 39095 elec1cnvxrn2 39110 eleccossin 39263 |
| Copyright terms: Public domain | W3C validator |