Theorem ishgrag 10769

Description: Express the predicate "H is a hypergraph." Definition of hypergraph in [Diestel] p. 28, which states "A hypergraph is a pair (V, E) of disjoint sets, where the elements of E are non-empty subsets (of any cardinality) of V."

Because V and E are both used as symbols (for the universal class df-v 1812 and the epsilon relation df-eprel 2832, respectively) in Metamath, we instead use A to represent V, the set of vertices or atoms of the hypergraph, and B to represent E, the set of edges or blocks that each connect one or more atoms in A. (See Definition 2.1 in [McKMegPav] p. 2384 for an analogous use of atom and block in Greechie diagrams.)

Hypothesis

Ref	Expression
ishgrag.1	|- H = <.A, B>.

Assertion

Ref	Expression
ishgrag	|- ((A e. C /\ B e. D) -> (H e. HypGrph <-> ((A i^i B) = (/) /\ A.b e. B (b (_ A /\ b =/= (/)))))

Distinct variable groups:   A,b   B,b

Proof of Theorem ishgrag

Step	Hyp	Ref	Expression
1		ineq1 2210	. . . . . . 7 |- (x = A -> (x i^i y) = (A i^i y))
2	1	eqeq1d 1483	. . . . . 6 |- (x = A -> ((x i^i y) = (/) <-> (A i^i y) = (/)))
3		pweq 2403	. . . . . . . 8 |- (x = A -> P~x = P~A)
4	3	difeq1d 2158	. . . . . . 7 |- (x = A -> (P~x \ {(/)}) = (P~A \ {(/)}))
5	4	sseq2d 2089	. . . . . 6 |- (x = A -> (y (_ (P~x \ {(/)}) <-> y (_ (P~A \ {(/)})))
6	2, 5	anbi12d 628	. . . . 5 |- (x = A -> (((x i^i y) = (/) /\ y (_ (P~x \ {(/)})) <-> ((A i^i y) = (/) /\ y (_ (P~A \ {(/)}))))
7		ineq2 2211	. . . . . . 7 |- (y = B -> (A i^i y) = (A i^i B))
8	7	eqeq1d 1483	. . . . . 6 |- (y = B -> ((A i^i y) = (/) <-> (A i^i B) = (/)))
9		sseq1 2082	. . . . . 6 |- (y = B -> (y (_ (P~A \ {(/)}) <-> B (_ (P~A \ {(/)})))
10	8, 9	anbi12d 628	. . . . 5 |- (y = B -> (((A i^i y) = (/) /\ y (_ (P~A \ {(/)})) <-> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)}))))
11	6, 10	opelopabg 2817	. . . 4 |- ((A e. C /\ B e. D) -> (<.A, B>. e. {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))} <-> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)}))))
12		df-hgra 10766	. . . . 5 |- HypGrph = {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
13	12	eleq2i 1538	. . . 4 |- (<.A, B>. e. HypGrph <-> <.A, B>. e. {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))})
14	11, 13	syl5bb 532	. . 3 |- ((A e. C /\ B e. D) -> (<.A, B>. e. HypGrph <-> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)}))))
15		ishgrag.1	. . . 4 |- H = <.A, B>.
16	15	eleq1i 1537	. . 3 |- (H e. HypGrph <-> <.A, B>. e. HypGrph)
17	14, 16	syl5bb 532	. 2 |- ((A e. C /\ B e. D) -> (H e. HypGrph <-> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)}))))
18		blkssatm 10767	. . 3 |- (B (_ (P~A \ {(/)}) <-> A.b e. B (b (_ A /\ b =/= (/)))
19	18	anbi2i 480	. 2 |- (((A i^i B) = (/) /\ B (_ (P~A \ {(/)})) <-> ((A i^i B) = (/) /\ A.b e. B (b (_ A /\ b =/= (/))))
20	17, 19	syl6bb 536	1 |- ((A e. C /\ B e. D) -> (H e. HypGrph <-> ((A i^i B) = (/) /\ A.b e. B (b (_ A /\ b =/= (/)))))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958   =/= wne 1585  A.wral 1645   \ cdif 2044   i^i cin 2046   (_ wss 2047  (/)c0 2280  P~cpw 2401  {csn 2409  <.cop 2411  {copab 2666  HypGrphchgra 10765

This theorem is referenced by:  emhgrat 10775

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-ral 1649  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-hgra 10766

Copyright terms: Public domain