| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > erdm | GIF version | ||
| Description: The domain of an equivalence relation. (Contributed by Mario Carneiro, 12-Aug-2015.) |
| Ref | Expression |
|---|---|
| erdm | ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-er 6807 | . 2 ⊢ (𝑅 Er 𝐴 ↔ (Rel 𝑅 ∧ dom 𝑅 = 𝐴 ∧ (◡𝑅 ∪ (𝑅 ∘ 𝑅)) ⊆ 𝑅)) | |
| 2 | 1 | simp2bi 1044 | 1 ⊢ (𝑅 Er 𝐴 → dom 𝑅 = 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∪ cun 3218 ⊆ wss 3220 ◡ccnv 4773 dom cdm 4774 ∘ ccom 4778 Rel wrel 4779 Er wer 6804 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-er 6807 |
| This theorem is used by: ercl 6818 erref 6827 errn 6829 erssxp 6830 erexb 6832 ereldm 6852 uniqs2 6869 iinerm 6881 th3qlem1 6911 0nnq 7731 nnnq0lem1 7813 prsrlem1 8109 gt0srpr 8115 0nsr 8116 divsfval 13649 |
| Copyright terms: Public domain | W3C validator |