Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > releqd | GIF version |
Description: Equality deduction for the relation predicate. (Contributed by NM, 8-Mar-2014.) |
Ref | Expression |
---|---|
releqd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
releqd | ⊢ (𝜑 → (Rel 𝐴 ↔ Rel 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | releqd.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
2 | releq 4702 | . 2 ⊢ (𝐴 = 𝐵 → (Rel 𝐴 ↔ Rel 𝐵)) | |
3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (Rel 𝐴 ↔ Rel 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1353 Rel wrel 4625 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-11 1504 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-in 3133 df-ss 3140 df-rel 4627 |
This theorem is referenced by: dftpos3 6253 tposfo2 6258 tposf12 6260 lmreltop 13244 cnprcl2k 13257 |
Copyright terms: Public domain | W3C validator |