| 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 3461 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐴 ∈ V) | |
| 2 | ecexr 8640 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) | |
| 3 | 1, 2 | jca 511 | . . 3 ⊢ (𝐴 ∈ [𝐵]𝑅 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 4 | 3 | adantl 481 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ [𝐵]𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 5 | brrelex12 5676 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 6 | 5 | ancomd 461 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | elecg 8679 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴)) | |
| 8 | 4, 6, 7 | pm5.21nd 801 | 1 ⊢ (Rel 𝑅 → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 Vcvv 3440 class class class wbr 5098 Rel wrel 5629 [cec 8633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ec 8637 |
| This theorem is referenced by: elecres 8683 eqgid 19109 eqg0el 19112 tgptsmscls 24094 pstmfval 34053 ismntop 34183 topfneec 36549 releleccnv 38451 elec1cnvres 38464 eleccnvep 38476 inecmo 38544 elecxrn 38586 elec1cnvxrn2 38601 eleccossin 38742 |
| Copyright terms: Public domain | W3C validator |