![]() |
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 482 | . . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝑅 Er 𝑋) | |
2 | simpr 484 | . . 3 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
3 | 1, 2 | erref 8783 | . 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴𝑅𝐴) |
4 | elecg 8807 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴)) | |
5 | 2, 4 | sylancom 587 | . 2 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴)) |
6 | 3, 5 | mpbird 257 | 1 ⊢ ((𝑅 Er 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ [𝐴]𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2108 class class class wbr 5166 Er wer 8760 [cec 8761 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-br 5167 df-opab 5229 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-er 8763 df-ec 8765 |
This theorem is referenced by: ghmqusnsglem1 19320 ghmqusnsglem2 19321 ghmquskerlem1 19323 ghmquskerlem2 19325 qsdrnglem2 33489 |
Copyright terms: Public domain | W3C validator |