| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ecref | Structured version Visualization version GIF version | ||
| Description: All elements are in their own equivalence class. (Contributed by Thierry Arnoux, 14-Feb-2025.) |
| Ref | Expression |
|---|---|
| ecref | ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ [𝐴]𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 487 | . . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝑅 Er 𝑋) | |
| 2 | simpr 489 | . . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 3 | 1, 2 | erref 8703 | . 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴𝑅𝐴) |
| 4 | elecg 8727 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴)) | |
| 5 | 2, 4 | sylancom 599 | . 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴)) |
| 6 | 3, 5 | mpbird 260 | 1 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ [𝐴]𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2145 class class class wbr 5105 Er wer 8679 [cec 8680 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-br 5106 df-opab 5168 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-er 8682 df-ec 8684 |
| This theorem is referenced by: ghmqusnsglem1 19341 ghmqusnsglem2 19342 ghmquskerlem1 19344 ghmquskerlem2 19346 qsdrnglem2 33695 |
| Copyright terms: Public domain | W3C validator |