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

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

Proof of Theorem hgrarel
StepHypRef Expression
1 relopab 3266 . 2 |- Rel {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
2 df-hgra 10766 . . 3 |- HypGrph = {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
32releqi 3244 . 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 956   \ cdif 2044   i^i cin 2046   (_ wss 2047  (/)c0 2280  P~cpw 2401  {csn 2409  {copab 2666  Rel wrel 3175  HypGrphchgra 10765
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-opab 2667  df-xp 3184  df-rel 3185  df-hgra 10766
Copyright terms: Public domain