Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > breq2i | GIF version |
Description: Equality inference for a binary relation. (Contributed by NM, 8-Feb-1996.) |
Ref | Expression |
---|---|
breq1i.1 | ⊢ 𝐴 = 𝐵 |
Ref | Expression |
---|---|
breq2i | ⊢ (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
2 | breq2 3933 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵)) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐶𝑅𝐴 ↔ 𝐶𝑅𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 = wceq 1331 class class class wbr 3929 |
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-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-un 3075 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 |
This theorem is referenced by: breqtri 3953 en1 6693 snnen2og 6753 1nen2 6755 pm54.43 7046 caucvgprprlemval 7503 caucvgprprlemmu 7510 caucvgsr 7617 pitonnlem1 7660 lt0neg2 8238 le0neg2 8240 negap0 8399 recexaplem2 8420 recgt1 8662 crap0 8723 addltmul 8963 nn0lt10b 9138 nn0lt2 9139 3halfnz 9155 xlt0neg2 9629 xle0neg2 9631 iccshftr 9784 iccshftl 9786 iccdil 9788 icccntr 9790 fihashen1 10552 cjap0 10686 abs00ap 10841 xrmaxiflemval 11026 mertenslem2 11312 mertensabs 11313 3dvdsdec 11569 3dvds2dec 11570 ndvdsi 11637 3prm 11816 prmfac1 11837 sinhalfpilem 12882 sincosq1lem 12916 sincosq1sgn 12917 sincosq2sgn 12918 sincosq3sgn 12919 sincosq4sgn 12920 |
Copyright terms: Public domain | W3C validator |