| 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 3471 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐴 ∈ V) | |
| 2 | ecexr 8727 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝐴 ∈ [𝐵]𝑅 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ [𝐵]𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 5 | brrelex12 5702 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 6 | 5 | ancomd 467 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | elecg 8767 | . 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 2144 Vcvv 3450 class class class wbr 5102 Rel wrel 5655 [cec 8720 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ec 8724 |
| This theorem is used by: elecres 8771 eqgid 19399 eqg0el 19405 tgptsmscls 24476 pstmfval 34576 ismntop 34706 topfneec 37237 releleccnv 39299 elec1cnvres 39314 eleccnvep 39326 inecmo 39394 elecxrn 39444 elec1cnvxrn2 39459 eleccossin 39612 |
| Copyright terms: Public domain | W3C validator |