Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > brabg | Unicode version |
Description: The law of concretion for a binary relation. (Contributed by NM, 16-Aug-1999.) (Revised by Mario Carneiro, 19-Dec-2013.) |
Ref | Expression |
---|---|
opelopabg.1 | |
opelopabg.2 | |
brabg.5 |
Ref | Expression |
---|---|
brabg |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelopabg.1 | . . 3 | |
2 | opelopabg.2 | . . 3 | |
3 | 1, 2 | sylan9bb 458 | . 2 |
4 | brabg.5 | . 2 | |
5 | 3, 4 | brabga 4236 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1342 wcel 2135 class class class wbr 3976 copab 4036 |
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 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-v 2723 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-br 3977 df-opab 4038 |
This theorem is referenced by: brab 4244 opbrop 4677 ideqg 4749 opelcnvg 4778 bren 6704 brdomg 6705 enq0breq 7368 ltresr 7771 ltxrlt 7955 apreap 8476 apreim 8492 shftfibg 10748 shftfib 10751 2shfti 10759 |
Copyright terms: Public domain | W3C validator |