Theorem cusgrafilem2 24601

Description: Lemma 2 for cusgrafi 24603. (Contributed by Alexander van der Vekens, 13-Jan-2018.)

Hypotheses

Ref	Expression
cusgrafi.p	|- P = { x e. ~P V | E. a e. V ( a =/= N /\ x = { a , N } ) }
cusgrafi.f	|- F = ( x e. ( V \ { N } ) |-> { x , N } )

Assertion

Ref	Expression
cusgrafilem2	|- ( ( V e. W /\ N e. V ) -> F : ( V \ { N } ) -1-1-onto-> P )

Distinct variable groups:   N, a, x   V, a, x   x, P   W, a, x

Allowed substitution hints:   P( a)   F( x, a)

Proof of Theorem cusgrafilem2

Dummy variables e v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifsn 4069	. . . . . . 7 |- ( v e. ( V \ { N } ) <-> ( v e. V /\ v =/= N ) )
2		simpl 455	. . . . . . 7 |- ( ( v e. V /\ v =/= N ) -> v e. V )
3	1, 2	sylbi 195	. . . . . 6 |- ( v e. ( V \ { N } ) -> v e. V )
4		simpr 459	. . . . . 6 |- ( ( V e. W /\ N e. V ) -> N e. V )
5		prelpwi 4609	. . . . . 6 |- ( ( v e. V /\ N e. V ) -> { v , N } e. ~P V )
6	3, 4, 5	syl2anr 476	. . . . 5 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> { v , N } e. ~P V )
7	1	biimpi 194	. . . . . . 7 |- ( v e. ( V \ { N } ) -> ( v e. V /\ v =/= N ) )
8	7	adantl 464	. . . . . 6 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> ( v e. V /\ v =/= N ) )
9		simpr 459	. . . . . . . . 9 |- ( ( v e. V /\ v =/= N ) -> v =/= N )
10	1, 9	sylbi 195	. . . . . . . 8 |- ( v e. ( V \ { N } ) -> v =/= N )
11	10	adantl 464	. . . . . . 7 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> v =/= N )
12		eqidd 2383	. . . . . . 7 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> { v , N } = { v , N } )
13	11, 12	jca 530	. . . . . 6 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> ( v =/= N /\ { v , N } = { v , N } ) )
14		neeq1 2663	. . . . . . . . 9 |- ( a = v -> ( a =/= N <-> v =/= N ) )
15		preq1 4023	. . . . . . . . . 10 |- ( a = v -> { a , N } = { v , N } )
16	15	eqeq2d 2396	. . . . . . . . 9 |- ( a = v -> ( { v , N } = { a , N } <-> { v , N } = { v , N } ) )
17	14, 16	anbi12d 708	. . . . . . . 8 |- ( a = v -> ( ( a =/= N /\ { v , N } = { a , N } ) <-> ( v =/= N /\ { v , N } = { v , N } ) ) )
18	17	adantl 464	. . . . . . 7 |- ( ( ( v e. V /\ v =/= N ) /\ a = v ) -> ( ( a =/= N /\ { v , N } = { a , N } ) <-> ( v =/= N /\ { v , N } = { v , N } ) ) )
19	2, 18	rspcedv 3139	. . . . . 6 |- ( ( v e. V /\ v =/= N ) -> ( ( v =/= N /\ { v , N } = { v , N } ) -> E. a e. V ( a =/= N /\ { v , N } = { a , N } ) ) )
20	8, 13, 19	sylc 60	. . . . 5 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> E. a e. V ( a =/= N /\ { v , N } = { a , N } ) )
21		eqeq1 2386	. . . . . . . 8 |- ( x = { v , N } -> ( x = { a , N } <-> { v , N } = { a , N } ) )
22	21	anbi2d 701	. . . . . . 7 |- ( x = { v , N } -> ( ( a =/= N /\ x = { a , N } ) <-> ( a =/= N /\ { v , N } = { a , N } ) ) )
23	22	rexbidv 2893	. . . . . 6 |- ( x = { v , N } -> ( E. a e. V ( a =/= N /\ x = { a , N } ) <-> E. a e. V ( a =/= N /\ { v , N } = { a , N } ) ) )
24		cusgrafi.p	. . . . . 6 |- P = { x e. ~P V | E. a e. V ( a =/= N /\ x = { a , N } ) }
25	23, 24	elrab2 3184	. . . . 5 |- ( { v , N } e. P <-> ( { v , N } e. ~P V /\ E. a e. V ( a =/= N /\ { v , N } = { a , N } ) ) )
26	6, 20, 25	sylanbrc 662	. . . 4 |- ( ( ( V e. W /\ N e. V ) /\ v e. ( V \ { N } ) ) -> { v , N } e. P )
27	26	ralrimiva 2796	. . 3 |- ( ( V e. W /\ N e. V ) -> A. v e. ( V \ { N } ) { v , N } e. P )
28		preq1 4023	. . . . 5 |- ( x = v -> { x , N } = { v , N } )
29	28	eleq1d 2451	. . . 4 |- ( x = v -> ( { x , N } e. P <-> { v , N } e. P ) )
30	29	cbvralv 3009	. . 3 |- ( A. x e. ( V \ { N } ) { x , N } e. P <-> A. v e. ( V \ { N } ) { v , N } e. P )
31	27, 30	sylibr 212	. 2 |- ( ( V e. W /\ N e. V ) -> A. x e. ( V \ { N } ) { x , N } e. P )
32		simpl 455	. . . . . . . . . . 11 |- ( ( a =/= N /\ e = { a , N } ) -> a =/= N )
33	32	anim2i 567	. . . . . . . . . 10 |- ( ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) -> ( a e. V /\ a =/= N ) )
34	33	adantl 464	. . . . . . . . 9 |- ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) -> ( a e. V /\ a =/= N ) )
35		eldifsn 4069	. . . . . . . . 9 |- ( a e. ( V \ { N } ) <-> ( a e. V /\ a =/= N ) )
36	34, 35	sylibr 212	. . . . . . . 8 |- ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) -> a e. ( V \ { N } ) )
37		eqeq1 2386	. . . . . . . . . . . . . 14 |- ( e = { a , N } -> ( e = { x , N } <-> { a , N } = { x , N } ) )
38	37	adantl 464	. . . . . . . . . . . . 13 |- ( ( a =/= N /\ e = { a , N } ) -> ( e = { x , N } <-> { a , N } = { x , N } ) )
39	38	ad2antlr 724	. . . . . . . . . . . 12 |- ( ( ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) /\ x e. ( V \ { N } ) ) -> ( e = { x , N } <-> { a , N } = { x , N } ) )
40		vex 3037	. . . . . . . . . . . . . 14 |- a e. _V
41		vex 3037	. . . . . . . . . . . . . 14 |- x e. _V
42	40, 41	preqr1 4118	. . . . . . . . . . . . 13 |- ( { a , N } = { x , N } -> a = x )
43	42	eqcomd 2390	. . . . . . . . . . . 12 |- ( { a , N } = { x , N } -> x = a )
44	39, 43	syl6bi 228	. . . . . . . . . . 11 |- ( ( ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) /\ x e. ( V \ { N } ) ) -> ( e = { x , N } -> x = a ) )
45	44	adantll 711	. . . . . . . . . 10 |- ( ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) /\ x e. ( V \ { N } ) ) -> ( e = { x , N } -> x = a ) )
46		preq1 4023	. . . . . . . . . . . . . . . 16 |- ( a = x -> { a , N } = { x , N } )
47	46	equcoms 1803	. . . . . . . . . . . . . . 15 |- ( x = a -> { a , N } = { x , N } )
48	47	eqeq2d 2396	. . . . . . . . . . . . . 14 |- ( x = a -> ( e = { a , N } <-> e = { x , N } ) )
49	48	biimpcd 224	. . . . . . . . . . . . 13 |- ( e = { a , N } -> ( x = a -> e = { x , N } ) )
50	49	adantl 464	. . . . . . . . . . . 12 |- ( ( a =/= N /\ e = { a , N } ) -> ( x = a -> e = { x , N } ) )
51	50	adantl 464	. . . . . . . . . . 11 |- ( ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) -> ( x = a -> e = { x , N } ) )
52	51	ad2antlr 724	. . . . . . . . . 10 |- ( ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) /\ x e. ( V \ { N } ) ) -> ( x = a -> e = { x , N } ) )
53	45, 52	impbid 191	. . . . . . . . 9 |- ( ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) /\ x e. ( V \ { N } ) ) -> ( e = { x , N } <-> x = a ) )
54	53	ralrimiva 2796	. . . . . . . 8 |- ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) -> A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) )
55	36, 54	jca 530	. . . . . . 7 |- ( ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) /\ ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) ) -> ( a e. ( V \ { N } ) /\ A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) ) )
56	55	ex 432	. . . . . 6 |- ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) -> ( ( a e. V /\ ( a =/= N /\ e = { a , N } ) ) -> ( a e. ( V \ { N } ) /\ A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) ) ) )
57	56	reximdv2 2853	. . . . 5 |- ( ( ( V e. W /\ N e. V ) /\ e e. ~P V ) -> ( E. a e. V ( a =/= N /\ e = { a , N } ) -> E. a e. ( V \ { N } ) A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) ) )
58	57	expimpd 601	. . . 4 |- ( ( V e. W /\ N e. V ) -> ( ( e e. ~P V /\ E. a e. V ( a =/= N /\ e = { a , N } ) ) -> E. a e. ( V \ { N } ) A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) ) )
59		eqeq1 2386	. . . . . . 7 |- ( x = e -> ( x = { a , N } <-> e = { a , N } ) )
60	59	anbi2d 701	. . . . . 6 |- ( x = e -> ( ( a =/= N /\ x = { a , N } ) <-> ( a =/= N /\ e = { a , N } ) ) )
61	60	rexbidv 2893	. . . . 5 |- ( x = e -> ( E. a e. V ( a =/= N /\ x = { a , N } ) <-> E. a e. V ( a =/= N /\ e = { a , N } ) ) )
62	61, 24	elrab2 3184	. . . 4 |- ( e e. P <-> ( e e. ~P V /\ E. a e. V ( a =/= N /\ e = { a , N } ) ) )
63		reu6 3213	. . . 4 |- ( E! x e. ( V \ { N } ) e = { x , N } <-> E. a e. ( V \ { N } ) A. x e. ( V \ { N } ) ( e = { x , N } <-> x = a ) )
64	58, 62, 63	3imtr4g 270	. . 3 |- ( ( V e. W /\ N e. V ) -> ( e e. P -> E! x e. ( V \ { N } ) e = { x , N } ) )
65	64	ralrimiv 2794	. 2 |- ( ( V e. W /\ N e. V ) -> A. e e. P E! x e. ( V \ { N } ) e = { x , N } )
66		cusgrafi.f	. . 3 |- F = ( x e. ( V \ { N } ) |-> { x , N } )
67	66	f1ompt 5955	. 2 |- ( F : ( V \ { N } ) -1-1-onto-> P <-> ( A. x e. ( V \ { N } ) { x , N } e. P /\ A. e e. P E! x e. ( V \ { N } ) e = { x , N } ) )
68	31, 65, 67	sylanbrc 662	1 |- ( ( V e. W /\ N e. V ) -> F : ( V \ { N } ) -1-1-onto-> P )

Syntax hints:   -> wi 4   <-> wb 184   /\ wa 367   = wceq 1399   e. wcel 1826   =/= wne 2577   A.wral 2732   E.wrex 2733   E!wreu 2734   {crab 2736   \ cdif 3386   ~Pcpw 3927   {csn 3944   {cpr 3946   |-> cmpt 4425   -1-1-onto->wf1o 5495

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-sep 4488  ax-nul 4496  ax-pr 4601

This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-ral 2737  df-rex 2738  df-reu 2739  df-rab 2741  df-v 3036  df-sbc 3253  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-nul 3712  df-if 3858  df-pw 3929  df-sn 3945  df-pr 3947  df-op 3951  df-uni 4164  df-br 4368  df-opab 4426  df-mpt 4427  df-id 4709  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-rn 4924  df-res 4925  df-ima 4926  df-iota 5460  df-fun 5498  df-fn 5499  df-f 5500  df-f1 5501  df-fo 5502  df-f1o 5503  df-fv 5504

This theorem is referenced by:  cusgrafilem3  24602