Table of ContentsTable of Contents User Sandbox < Previous   Next >
Related theorems
Unicode version

Theorem hgrarel 10712
Description: The class of all hypergraphs is a relation.
Assertion
Ref Expression
hgrarel |- Rel HypGrph

Proof of Theorem hgrarel
StepHypRef Expression
1 relopab 3263 . 2 |- Rel {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
2 df-hgra 10710 . . 3 |- HypGrph = {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
32releqi 3241 . 2 |- (Rel HypGrph <-> Rel {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))})
41, 3mpbir 190 1 |- Rel HypGrph
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 955   \ cdif 2042   i^i cin 2044   (_ wss 2045  (/)c0 2278  P~cpw 2399  {csn 2407  {copab 2663  Rel wrel 3172  HypGrphchgra 10709
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2700  ax-pow 2739  ax-pr 2776
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1586  df-v 1810  df-dif 2047  df-un 2048  df-in 2049  df-ss 2051  df-nul 2279  df-pw 2400  df-sn 2410  df-pr 2411  df-op 2414  df-opab 2664  df-xp 3181  df-rel 3182  df-hgra 10710
Copyright terms: Public domain