| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > symreleq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for symmetric relation. (Contributed by Peter Mazsa, 15-Apr-2019.) (Revised by Peter Mazsa, 23-Sep-2021.) |
| Ref | Expression |
|---|---|
| symreleq | ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnveq 5851 | . . . 4 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
| 2 | id 23 | . . . 4 ⊢ (𝑅 = 𝑆 → 𝑅 = 𝑆) | |
| 3 | 1, 2 | sseq12d 3942 | . . 3 ⊢ (𝑅 = 𝑆 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑆 ⊆ 𝑆)) |
| 4 | releq 5753 | . . 3 ⊢ (𝑅 = 𝑆 → (Rel 𝑅 ↔ Rel 𝑆)) | |
| 5 | 3, 4 | anbi12d 644 | . 2 ⊢ (𝑅 = 𝑆 → ((◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅) ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆))) |
| 6 | dfsymrel2 39672 | . 2 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 7 | dfsymrel2 39672 | . 2 ⊢ ( SymRel 𝑆 ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆)) | |
| 8 | 5, 6, 7 | 3bitr4g 317 | 1 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ⊆ wss 3896 ◡ccnv 5649 Rel wrel 5655 SymRel wsymrel 39234 |
| 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 5390 |
| 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 5656 df-rel 5657 df-cnv 5658 df-dm 5660 df-rn 5661 df-res 5662 df-symrel 39663 |
| This theorem is used by: eqvreleq 39725 |
| Copyright terms: Public domain | W3C validator |