| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfsymrel4 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the symmetric relation predicate. (Contributed by Peter Mazsa, 17-Aug-2021.) |
| Ref | Expression |
|---|---|
| dfsymrel4 | ⊢ ( SymRel 𝑅 ↔ (◡𝑅 = 𝑅 ∧ Rel 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsymrel2 39702 | . 2 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 2 | relcnveq 39397 | . . 3 ⊢ (Rel 𝑅 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑅 = 𝑅)) | |
| 3 | 2 | pm5.32ri 586 | . 2 ⊢ ((◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅) ↔ (◡𝑅 = 𝑅 ∧ Rel 𝑅)) |
| 4 | 1, 3 | bitri 278 | 1 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 = 𝑅 ∧ Rel 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1569 ⊆ wss 3896 ◡ccnv 5650 Rel wrel 5656 SymRel wsymrel 39264 |
| 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 5391 |
| 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 5657 df-rel 5658 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-symrel 39693 |
| This theorem is used by: symrelim 39712 idsymrel 39714 epnsymrel 39715 |
| Copyright terms: Public domain | W3C validator |