![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > trreleq | Structured version Visualization version GIF version |
Description: Equality theorem for the transitive relation predicate. (Contributed by Peter Mazsa, 15-Apr-2019.) (Revised by Peter Mazsa, 23-Sep-2021.) |
Ref | Expression |
---|---|
trreleq | ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | coideq 35667 | . . . 4 ⊢ (𝑅 = 𝑆 → (𝑅 ∘ 𝑅) = (𝑆 ∘ 𝑆)) | |
2 | id 22 | . . . 4 ⊢ (𝑅 = 𝑆 → 𝑅 = 𝑆) | |
3 | 1, 2 | sseq12d 3948 | . . 3 ⊢ (𝑅 = 𝑆 → ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ (𝑆 ∘ 𝑆) ⊆ 𝑆)) |
4 | releq 5615 | . . 3 ⊢ (𝑅 = 𝑆 → (Rel 𝑅 ↔ Rel 𝑆)) | |
5 | 3, 4 | anbi12d 633 | . 2 ⊢ (𝑅 = 𝑆 → (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅) ↔ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ∧ Rel 𝑆))) |
6 | dftrrel2 35973 | . 2 ⊢ ( TrRel 𝑅 ↔ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅)) | |
7 | dftrrel2 35973 | . 2 ⊢ ( TrRel 𝑆 ↔ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ∧ Rel 𝑆)) | |
8 | 5, 6, 7 | 3bitr4g 317 | 1 ⊢ (𝑅 = 𝑆 → ( TrRel 𝑅 ↔ TrRel 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ⊆ wss 3881 ∘ ccom 5523 Rel wrel 5524 TrRel wtrrel 35628 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-trrel 35970 |
This theorem is referenced by: eqvreleq 35997 |
Copyright terms: Public domain | W3C validator |