Theorem hgralem 10770

Description: Lemma for various hypergraph theorems.

Hypotheses

Ref	Expression
hgralem.1	|- A = (1st` H)
hgralem.2	|- B = (2nd` H)

Assertion

Ref	Expression
hgralem	|- (H e. HypGrph -> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)})))

Proof of Theorem hgralem

Step	Hyp	Ref	Expression
1		df-hgra 10766	. . 3 |- HypGrph = {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))}
2	1	eleq2i 1538	. 2 |- (H e. HypGrph <-> H e. {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))})
3		hgralem.1	. . . . . . 7 |- A = (1st` H)
4	3	eqeq2i 1485	. . . . . 6 |- (x = A <-> x = (1st` H))
5		ineq1 2210	. . . . . 6 |- (x = A -> (x i^i y) = (A i^i y))
6	4, 5	sylbir 201	. . . . 5 |- (x = (1st` H) -> (x i^i y) = (A i^i y))
7	6	eqeq1d 1483	. . . 4 |- (x = (1st` H) -> ((x i^i y) = (/) <-> (A i^i y) = (/)))
8		pweq 2403	. . . . . . 7 |- (x = A -> P~x = P~A)
9	8	difeq1d 2158	. . . . . 6 |- (x = A -> (P~x \ {(/)}) = (P~A \ {(/)}))
10	9	sseq2d 2089	. . . . 5 |- (x = A -> (y (_ (P~x \ {(/)}) <-> y (_ (P~A \ {(/)})))
11	4, 10	sylbir 201	. . . 4 |- (x = (1st` H) -> (y (_ (P~x \ {(/)}) <-> y (_ (P~A \ {(/)})))
12	7, 11	anbi12d 628	. . 3 |- (x = (1st` H) -> (((x i^i y) = (/) /\ y (_ (P~x \ {(/)})) <-> ((A i^i y) = (/) /\ y (_ (P~A \ {(/)}))))
13		hgralem.2	. . . . . . 7 |- B = (2nd` H)
14	13	eqeq2i 1485	. . . . . 6 |- (y = B <-> y = (2nd` H))
15		ineq2 2211	. . . . . 6 |- (y = B -> (A i^i y) = (A i^i B))
16	14, 15	sylbir 201	. . . . 5 |- (y = (2nd` H) -> (A i^i y) = (A i^i B))
17	16	eqeq1d 1483	. . . 4 |- (y = (2nd` H) -> ((A i^i y) = (/) <-> (A i^i B) = (/)))
18		sseq1 2082	. . . . 5 |- (y = B -> (y (_ (P~A \ {(/)}) <-> B (_ (P~A \ {(/)})))
19	14, 18	sylbir 201	. . . 4 |- (y = (2nd` H) -> (y (_ (P~A \ {(/)}) <-> B (_ (P~A \ {(/)})))
20	17, 19	anbi12d 628	. . 3 |- (y = (2nd` H) -> (((A i^i y) = (/) /\ y (_ (P~A \ {(/)})) <-> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)}))))
21	12, 20	elopabi 4117	. 2 |- (H e. {<.x, y>. | ((x i^i y) = (/) /\ y (_ (P~x \ {(/)}))} -> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)})))
22	2, 21	sylbi 199	1 |- (H e. HypGrph -> ((A i^i B) = (/) /\ B (_ (P~A \ {(/)})))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958   \ cdif 2044   i^i cin 2046   (_ wss 2047  (/)c0 2280  P~cpw 2401  {csn 2409  {copab 2666  ` cfv 3182  1stc1st 4077  2ndc2nd 4078  HypGrphchgra 10765

This theorem is referenced by:  hgradj 10771  hgrablkconn 10772

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-9 965  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-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866

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-rex 1650  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-uni 2504  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fv 3198  df-1st 4079  df-2nd 4080  df-hgra 10766

Copyright terms: Public domain