| 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 3475 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐴 ∈ V) | |
| 2 | ecexr 8760 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝐴 ∈ [𝐵]𝑅 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ [𝐵]𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 5 | brrelex12 5710 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 6 | 5 | ancomd 467 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | elecg 8800 | . 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 2147 Vcvv 3454 class class class wbr 5108 Rel wrel 5663 [cec 8753 |
| 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 |
| 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-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 |
| This theorem is used by: elecres 8804 eqgid 19442 eqg0el 19448 tgptsmscls 24524 pstmfval 34639 ismntop 34769 topfneec 37358 releleccnv 39458 elec1cnvres 39473 eleccnvep 39485 inecmo 39553 elecxrn 39603 elec1cnvxrn2 39618 eleccossin 39771 |
| Copyright terms: Public domain | W3C validator |