Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > breqd | Unicode version |
Description: Equality deduction for a binary relation. (Contributed by NM, 29-Oct-2011.) |
Ref | Expression |
---|---|
breq1d.1 |
Ref | Expression |
---|---|
breqd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1d.1 | . 2 | |
2 | breq 3901 | . 2 | |
3 | 1, 2 | syl 14 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1316 class class class wbr 3899 |
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 1408 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-4 1472 ax-17 1491 ax-ial 1499 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-cleq 2110 df-clel 2113 df-br 3900 |
This theorem is referenced by: breq123d 3913 breqdi 3914 sbcbr12g 3953 supeq123d 6846 shftfibg 10560 shftfib 10563 2shfti 10571 lmbr 12309 |
Copyright terms: Public domain | W3C validator |