Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > releqi | GIF version |
Description: Equality inference for the relation predicate. (Contributed by NM, 8-Dec-2006.) |
Ref | Expression |
---|---|
releqi.1 | ⊢ 𝐴 = 𝐵 |
Ref | Expression |
---|---|
releqi | ⊢ (Rel 𝐴 ↔ Rel 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | releqi.1 | . 2 ⊢ 𝐴 = 𝐵 | |
2 | releq 4616 | . 2 ⊢ (𝐴 = 𝐵 → (Rel 𝐴 ↔ Rel 𝐵)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (Rel 𝐴 ↔ Rel 𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 = wceq 1331 Rel wrel 4539 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-11 1484 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-in 3072 df-ss 3079 df-rel 4541 |
This theorem is referenced by: reliun 4655 reluni 4657 relint 4658 reldmmpo 5875 tfrlem6 6206 psmetrel 12480 metrel 12500 xmetrel 12501 xmetf 12508 mopnrel 12599 |
Copyright terms: Public domain | W3C validator |