![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > releq | 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 3062 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ⊆ (V × V) ↔ 𝐵 ⊆ (V × V))) | |
2 | df-rel 4474 | . 2 ⊢ (Rel 𝐴 ↔ 𝐴 ⊆ (V × V)) | |
3 | df-rel 4474 | . 2 ⊢ (Rel 𝐵 ↔ 𝐵 ⊆ (V × V)) | |
4 | 1, 2, 3 | 3bitr4g 222 | 1 ⊢ (𝐴 = 𝐵 → (Rel 𝐴 ↔ Rel 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1296 Vcvv 2633 ⊆ wss 3013 × cxp 4465 Rel wrel 4472 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-11 1449 ax-4 1452 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 |
This theorem depends on definitions: df-bi 116 df-nf 1402 df-sb 1700 df-clab 2082 df-cleq 2088 df-clel 2091 df-in 3019 df-ss 3026 df-rel 4474 |
This theorem is referenced by: releqi 4550 releqd 4551 dfrel2 4915 tposfn2 6069 ereq1 6339 |
Copyright terms: Public domain | W3C validator |