| 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 3472 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐴 ∈ V) | |
| 2 | ecexr 8706 | . . . 4 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) | |
| 3 | 1, 2 | jca 521 | . . 3 ⊢ (𝐴 ∈ [𝐵]𝑅 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 4 | 3 | adantl 487 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ [𝐵]𝑅) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 5 | brrelex12 5703 | . . 3 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐵 ∈ V ∧ 𝐴 ∈ V)) | |
| 6 | 5 | ancomd 467 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | elecg 8746 | . 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 2145 Vcvv 3451 class class class wbr 5103 Rel wrel 5656 [cec 8699 |
| 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 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| 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 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 df-rel 5658 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ec 8703 |
| This theorem is used by: elecres 8750 eqgid 19372 eqg0el 19378 tgptsmscls 24449 pstmfval 34510 ismntop 34640 topfneec 37113 releleccnv 39160 elec1cnvres 39175 eleccnvep 39187 inecmo 39255 elecxrn 39305 elec1cnvxrn2 39320 eleccossin 39473 |
| Copyright terms: Public domain | W3C validator |