| 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 5859 | . . . 4 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
| 2 | id 23 | . . . 4 ⊢ (𝑅 = 𝑆 → 𝑅 = 𝑆) | |
| 3 | 1, 2 | sseq12d 3970 | . . 3 ⊢ (𝑅 = 𝑆 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑆 ⊆ 𝑆)) |
| 4 | releq 5763 | . . 3 ⊢ (𝑅 = 𝑆 → (Rel 𝑅 ↔ Rel 𝑆)) | |
| 5 | 3, 4 | anbi12d 643 | . 2 ⊢ (𝑅 = 𝑆 → ((◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅) ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆))) |
| 6 | dfsymrel2 39282 | . 2 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 7 | dfsymrel2 39282 | . 2 ⊢ ( SymRel 𝑆 ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆)) | |
| 8 | 5, 6, 7 | 3bitr4g 317 | 1 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ⊆ wss 3905 ◡ccnv 5660 Rel wrel 5666 SymRel wsymrel 38844 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-symrel 39273 |
| This theorem is referenced by: eqvreleq 39335 |
| Copyright terms: Public domain | W3C validator |