New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > breqi | Unicode 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 4641 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 176 wceq 1642 class class class wbr 4639 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-11 1746 ax-ext 2334 |
This theorem depends on definitions: df-bi 177 df-an 360 df-ex 1542 df-cleq 2346 df-clel 2349 df-br 4640 |
This theorem is referenced by: brres 4949 trtxp 5781 brtxp 5783 brimage 5793 qrpprod 5836 brpprod 5839 fnfullfunlem1 5856 ersymtr 5932 porta 5933 sopc 5934 weds 5938 brltc 6114 nchoicelem8 6296 nchoicelem19 6307 |
Copyright terms: Public domain | W3C validator |