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 457 | . 2 |
4 | brabg.5 | . 2 | |
5 | 3, 4 | brabga 4181 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1331 wcel 1480 class class class wbr 3924 copab 3983 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-v 2683 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-br 3925 df-opab 3985 |
This theorem is referenced by: brab 4189 opbrop 4613 ideqg 4685 opelcnvg 4714 bren 6634 brdomg 6635 enq0breq 7237 ltresr 7640 ltxrlt 7823 apreap 8342 apreim 8358 shftfibg 10585 shftfib 10588 2shfti 10596 |
Copyright terms: Public domain | W3C validator |