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

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

Proof of Theorem hgrarel
StepHypRef Expression
1 relopab 3272 . 2 |- Rel {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
2 df-hgra 10737 . . 3 |- HypGrph = {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
32releqi 3250 . 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 958   \ cdif 2047   i^i cin 2049   (_ wss 2050  (/)c0 2283  P~cpw 2405  {csn 2413  {copab 2671  Rel wrel 3181  HypGrphchgra 10736
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-opab 2672  df-xp 3190  df-rel 3191  df-hgra 10737
Copyright terms: Public domain