Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > brabga | Unicode version |
Description: The law of concretion for a binary relation. (Contributed by Mario Carneiro, 19-Dec-2013.) |
Ref | Expression |
---|---|
opelopabga.1 | |
brabga.2 |
Ref | Expression |
---|---|
brabga |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-br 3983 | . . 3 | |
2 | brabga.2 | . . . 4 | |
3 | 2 | eleq2i 2233 | . . 3 |
4 | 1, 3 | bitri 183 | . 2 |
5 | opelopabga.1 | . . 3 | |
6 | 5 | opelopabga 4241 | . 2 |
7 | 4, 6 | syl5bb 191 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1343 wcel 2136 cop 3579 class class class wbr 3982 copab 4042 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 |
This theorem is referenced by: braba 4245 brabg 4247 epelg 4268 brcog 4771 fmptco 5651 ofrfval 6058 clim 11222 isstruct2im 12404 isstruct2r 12405 |
Copyright terms: Public domain | W3C validator |