| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > releq | Structured version Visualization version GIF version | ||
| Description: Equality theorem for the relation predicate. (Contributed by NM, 1-Aug-1994.) |
| Ref | Expression |
|---|---|
| releq | ⊢ (𝐴 = 𝐵 → (Rel 𝐴 ↔ Rel 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sseq1 3956 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ (V × V) ↔ 𝐵 ⊆ (V × V))) | |
| 2 | df-rel 5658 | . 2 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V)) | |
| 3 | df-rel 5658 | . 2 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V)) | |
| 4 | 1, 2, 3 | 3bitr4g 317 | 1 ⊢ (𝐴 = 𝐵 → (Rel 𝐴 ↔ Rel 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 Vcvv 3451 ⊆ wss 3899 × cxp 5649 Rel wrel 5656 |
| 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-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2753 df-ss 3916 df-rel 5658 |
| This theorem is used by: releqi 5754 releqd 5755 relsnb 5780 dfrel2 6181 tposfn2 8258 ereq1 8718 isps 18735 isdir 18765 fpwrelmapffslem 33317 bnj1321 35650 refreleq 39513 symreleq 39554 trreleq 39578 prtlem12 39904 relintabex 44566 clrellem 44607 clcnvlem 44608 rellan 50700 relran 50701 |
| Copyright terms: Public domain | W3C validator |