Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > braba | Structured version Visualization version Unicode version |
Description: The law of concretion for a binary relation. (Contributed by NM, 19-Dec-2013.) |
Ref | Expression |
---|---|
opelopaba.1 | |
opelopaba.2 | |
opelopaba.3 | |
braba.4 |
Ref | Expression |
---|---|
braba |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelopaba.1 | . 2 | |
2 | opelopaba.2 | . 2 | |
3 | opelopaba.3 | . . 3 | |
4 | braba.4 | . . 3 | |
5 | 3, 4 | brabga 4989 | . 2 |
6 | 1, 2, 5 | mp2an 708 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wceq 1483 wcel 1990 cvv 3200 class class class wbr 4653 copab 4712 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 |
This theorem is referenced by: frgpuplem 18185 2ndcctbss 21258 legov 25480 prtlem13 34153 wepwsolem 37612 fnwe2val 37619 sprsymrelf 41745 |
Copyright terms: Public domain | W3C validator |