| 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 5822 | . . . 4 ⊢ (𝑅 = 𝑆 → ◡𝑅 = ◡𝑆) | |
| 2 | id 22 | . . . 4 ⊢ (𝑅 = 𝑆 → 𝑅 = 𝑆) | |
| 3 | 1, 2 | sseq12d 3956 | . . 3 ⊢ (𝑅 = 𝑆 → (◡𝑅 ⊆ 𝑅 ↔ ◡𝑆 ⊆ 𝑆)) |
| 4 | releq 5726 | . . 3 ⊢ (𝑅 = 𝑆 → (Rel 𝑅 ↔ Rel 𝑆)) | |
| 5 | 3, 4 | anbi12d 633 | . 2 ⊢ (𝑅 = 𝑆 → ((◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅) ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆))) |
| 6 | dfsymrel2 38968 | . 2 ⊢ ( SymRel 𝑅 ↔ (◡𝑅 ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 7 | dfsymrel2 38968 | . 2 ⊢ ( SymRel 𝑆 ↔ (◡𝑆 ⊆ 𝑆 ∧ Rel 𝑆)) | |
| 8 | 5, 6, 7 | 3bitr4g 314 | 1 ⊢ (𝑅 = 𝑆 → ( SymRel 𝑅 ↔ SymRel 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ⊆ wss 3890 ◡ccnv 5623 Rel wrel 5629 SymRel wsymrel 38530 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 df-res 5636 df-symrel 38959 |
| This theorem is referenced by: eqvreleq 39021 |
| Copyright terms: Public domain | W3C validator |