| 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 5853 | . . . 4 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
| 2 | id 23 | . . . 4 ⊢ (𝑅 = 𝑆 → 𝑅 = 𝑆) | |
| 3 | 1, 2 | sseq12d 3964 | . . 3 ⊢ (𝑅 = 𝑆 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑆 ⊆ 𝑆)) |
| 4 | releq 5757 | . . 3 ⊢ (𝑅 = 𝑆 → (Rel 𝑅 ↔ Rel 𝑆)) | |
| 5 | 3, 4 | anbi12d 644 | . 2 ⊢ (𝑅 = 𝑆 → ((◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅) ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆))) |
| 6 | dfsymrel2 39381 | . 2 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 7 | dfsymrel2 39381 | . 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 1570 ⊆ wss 3899 ◡ccnv 5654 Rel wrel 5660 SymRel wsymrel 38943 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-symrel 39372 |
| This theorem is used by: eqvreleq 39434 |
| Copyright terms: Public domain | W3C validator |