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 459 | . 2 |
4 | brabg.5 | . 2 | |
5 | 3, 4 | brabga 4249 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1348 wcel 2141 class class class wbr 3989 copab 4049 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-v 2732 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-br 3990 df-opab 4051 |
This theorem is referenced by: brab 4257 opbrop 4690 ideqg 4762 opelcnvg 4791 bren 6725 brdomg 6726 enq0breq 7398 ltresr 7801 ltxrlt 7985 apreap 8506 apreim 8522 shftfibg 10784 shftfib 10787 2shfti 10795 |
Copyright terms: Public domain | W3C validator |