Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > breqi | GIF version |
Description: Equality inference for binary relations. (Contributed by NM, 19-Feb-2005.) |
Ref | Expression |
---|---|
breqi.1 | ⊢ 𝑅 = 𝑆 |
Ref | Expression |
---|---|
breqi | ⊢ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breqi.1 | . 2 ⊢ 𝑅 = 𝑆 | |
2 | breq 4000 | . 2 ⊢ (𝑅 = 𝑆 → (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴𝑅𝐵 ↔ 𝐴𝑆𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 105 = wceq 1353 class class class wbr 3998 |
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-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-4 1508 ax-17 1524 ax-ial 1532 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-cleq 2168 df-clel 2171 df-br 3999 |
This theorem is referenced by: f1ompt 5659 brtpos2 6242 tfrexlem 6325 brdifun 6552 ltpiord 7293 ltxrlt 7997 ltxr 9746 xmeterval 13515 |
Copyright terms: Public domain | W3C validator |