Theorem subfacp1lem4 29899

Description: Lemma for subfacp1 29902. The function F, which swaps 1 with M and leaves all other elements alone, is a bijection of order 2, i.e. it is its own inverse. (Contributed by Mario Carneiro, 19-Jan-2015.)

Hypotheses

Ref	Expression
derang.d	|- D = ( x e. Fin |-> ( # ` { f | ( f : x -1-1-onto-> x /\ A. y e. x ( f ` y ) =/= y ) } ) )
subfac.n	|- S = ( n e. NN0 |-> ( D ` ( 1 ... n ) ) )
subfacp1lem.a	|- A = { f | ( f : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) /\ A. y e. ( 1 ... ( N + 1 ) ) ( f ` y ) =/= y ) }
subfacp1lem1.n	|- ( ph -> N e. NN )
subfacp1lem1.m	|- ( ph -> M e. ( 2 ... ( N + 1 ) ) )
subfacp1lem1.x	|- M e. _V
subfacp1lem1.k	|- K = ( ( 2 ... ( N + 1 ) ) \ { M } )
subfacp1lem5.b	|- B = { g e. A | ( ( g ` 1 ) = M /\ ( g ` M ) =/= 1 ) }
subfacp1lem5.f	|- F = ( ( _I |` K ) u. { <. 1 , M >. , <. M , 1 >. } )

Assertion

Ref	Expression
subfacp1lem4	|- ( ph -> `' F = F )

Distinct variable groups:   f, g, n, x, y, A   f, F, g, x, y   f, N, g, n, x, y   B, f, g, x, y   ph, x, y   D, n   f, K, n, x, y   f, M, g, x, y   S, n, x, y

Allowed substitution hints:   ph( f, g, n)   B( n)   D( x, y, f, g)   S( f, g)   F( n)   K( g)   M( n)

Proof of Theorem subfacp1lem4

Step	Hyp	Ref	Expression
1		derang.d	. . . . 5 |- D = ( x e. Fin |-> ( # ` { f | ( f : x -1-1-onto-> x /\ A. y e. x ( f ` y ) =/= y ) } ) )
2		subfac.n	. . . . 5 |- S = ( n e. NN0 |-> ( D ` ( 1 ... n ) ) )
3		subfacp1lem.a	. . . . 5 |- A = { f | ( f : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) /\ A. y e. ( 1 ... ( N + 1 ) ) ( f ` y ) =/= y ) }
4		subfacp1lem1.n	. . . . 5 |- ( ph -> N e. NN )
5		subfacp1lem1.m	. . . . 5 |- ( ph -> M e. ( 2 ... ( N + 1 ) ) )
6		subfacp1lem1.x	. . . . 5 |- M e. _V
7		subfacp1lem1.k	. . . . 5 |- K = ( ( 2 ... ( N + 1 ) ) \ { M } )
8		subfacp1lem5.f	. . . . 5 |- F = ( ( _I |` K ) u. { <. 1 , M >. , <. M , 1 >. } )
9		f1oi 5848	. . . . . 6 |- ( _I |` K ) : K -1-1-onto-> K
10	9	a1i 11	. . . . 5 |- ( ph -> ( _I |` K ) : K -1-1-onto-> K )
11	1, 2, 3, 4, 5, 6, 7, 8, 10	subfacp1lem2a 29896	. . . 4 |- ( ph -> ( F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) /\ ( F ` 1 ) = M /\ ( F ` M ) = 1 ) )
12	11	simp1d 1019	. . 3 |- ( ph -> F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) )
13		f1ocnv 5824	. . 3 |- ( F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) -> `' F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) )
14		f1ofn 5813	. . 3 |- ( `' F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) -> `' F Fn ( 1 ... ( N + 1 ) ) )
15	12, 13, 14	3syl 18	. 2 |- ( ph -> `' F Fn ( 1 ... ( N + 1 ) ) )
16		f1ofn 5813	. . 3 |- ( F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) -> F Fn ( 1 ... ( N + 1 ) ) )
17	12, 16	syl 17	. 2 |- ( ph -> F Fn ( 1 ... ( N + 1 ) ) )
18	1, 2, 3, 4, 5, 6, 7	subfacp1lem1 29895	. . . . . . . 8 |- ( ph -> ( ( K i^i { 1 , M } ) = (/) /\ ( K u. { 1 , M } ) = ( 1 ... ( N + 1 ) ) /\ ( # ` K ) = ( N - 1 ) ) )
19	18	simp2d 1020	. . . . . . 7 |- ( ph -> ( K u. { 1 , M } ) = ( 1 ... ( N + 1 ) ) )
20	19	eleq2d 2513	. . . . . 6 |- ( ph -> ( x e. ( K u. { 1 , M } ) <-> x e. ( 1 ... ( N + 1 ) ) ) )
21	20	biimpar 488	. . . . 5 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> x e. ( K u. { 1 , M } ) )
22		elun 3573	. . . . 5 |- ( x e. ( K u. { 1 , M } ) <-> ( x e. K \/ x e. { 1 , M } ) )
23	21, 22	sylib 200	. . . 4 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> ( x e. K \/ x e. { 1 , M } ) )
24	1, 2, 3, 4, 5, 6, 7, 8, 10	subfacp1lem2b 29897	. . . . . . . 8 |- ( ( ph /\ x e. K ) -> ( F ` x ) = ( ( _I |` K ) ` x ) )
25		fvresi 6088	. . . . . . . . 9 |- ( x e. K -> ( ( _I |` K ) ` x ) = x )
26	25	adantl 468	. . . . . . . 8 |- ( ( ph /\ x e. K ) -> ( ( _I |` K ) ` x ) = x )
27	24, 26	eqtrd 2484	. . . . . . 7 |- ( ( ph /\ x e. K ) -> ( F ` x ) = x )
28	27	fveq2d 5867	. . . . . 6 |- ( ( ph /\ x e. K ) -> ( F ` ( F ` x ) ) = ( F ` x ) )
29	28, 27	eqtrd 2484	. . . . 5 |- ( ( ph /\ x e. K ) -> ( F ` ( F ` x ) ) = x )
30		vex 3047	. . . . . . 7 |- x e. _V
31	30	elpr 3985	. . . . . 6 |- ( x e. { 1 , M } <-> ( x = 1 \/ x = M ) )
32	11	simp2d 1020	. . . . . . . . . . 11 |- ( ph -> ( F ` 1 ) = M )
33	32	fveq2d 5867	. . . . . . . . . 10 |- ( ph -> ( F ` ( F ` 1 ) ) = ( F ` M ) )
34	11	simp3d 1021	. . . . . . . . . 10 |- ( ph -> ( F ` M ) = 1 )
35	33, 34	eqtrd 2484	. . . . . . . . 9 |- ( ph -> ( F ` ( F ` 1 ) ) = 1 )
36		fveq2 5863	. . . . . . . . . . 11 |- ( x = 1 -> ( F ` x ) = ( F ` 1 ) )
37	36	fveq2d 5867	. . . . . . . . . 10 |- ( x = 1 -> ( F ` ( F ` x ) ) = ( F ` ( F ` 1 ) ) )
38		id 22	. . . . . . . . . 10 |- ( x = 1 -> x = 1 )
39	37, 38	eqeq12d 2465	. . . . . . . . 9 |- ( x = 1 -> ( ( F ` ( F ` x ) ) = x <-> ( F ` ( F ` 1 ) ) = 1 ) )
40	35, 39	syl5ibrcom 226	. . . . . . . 8 |- ( ph -> ( x = 1 -> ( F ` ( F ` x ) ) = x ) )
41	34	fveq2d 5867	. . . . . . . . . 10 |- ( ph -> ( F ` ( F ` M ) ) = ( F ` 1 ) )
42	41, 32	eqtrd 2484	. . . . . . . . 9 |- ( ph -> ( F ` ( F ` M ) ) = M )
43		fveq2 5863	. . . . . . . . . . 11 |- ( x = M -> ( F ` x ) = ( F ` M ) )
44	43	fveq2d 5867	. . . . . . . . . 10 |- ( x = M -> ( F ` ( F ` x ) ) = ( F ` ( F ` M ) ) )
45		id 22	. . . . . . . . . 10 |- ( x = M -> x = M )
46	44, 45	eqeq12d 2465	. . . . . . . . 9 |- ( x = M -> ( ( F ` ( F ` x ) ) = x <-> ( F ` ( F ` M ) ) = M ) )
47	42, 46	syl5ibrcom 226	. . . . . . . 8 |- ( ph -> ( x = M -> ( F ` ( F ` x ) ) = x ) )
48	40, 47	jaod 382	. . . . . . 7 |- ( ph -> ( ( x = 1 \/ x = M ) -> ( F ` ( F ` x ) ) = x ) )
49	48	imp 431	. . . . . 6 |- ( ( ph /\ ( x = 1 \/ x = M ) ) -> ( F ` ( F ` x ) ) = x )
50	31, 49	sylan2b 478	. . . . 5 |- ( ( ph /\ x e. { 1 , M } ) -> ( F ` ( F ` x ) ) = x )
51	29, 50	jaodan 793	. . . 4 |- ( ( ph /\ ( x e. K \/ x e. { 1 , M } ) ) -> ( F ` ( F ` x ) ) = x )
52	23, 51	syldan 473	. . 3 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> ( F ` ( F ` x ) ) = x )
53	12	adantr 467	. . . 4 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) )
54		f1of 5812	. . . . . 6 |- ( F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) -> F : ( 1 ... ( N + 1 ) ) --> ( 1 ... ( N + 1 ) ) )
55	12, 54	syl 17	. . . . 5 |- ( ph -> F : ( 1 ... ( N + 1 ) ) --> ( 1 ... ( N + 1 ) ) )
56	55	ffvelrnda 6020	. . . 4 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> ( F ` x ) e. ( 1 ... ( N + 1 ) ) )
57		f1ocnvfv 6175	. . . 4 |- ( ( F : ( 1 ... ( N + 1 ) ) -1-1-onto-> ( 1 ... ( N + 1 ) ) /\ ( F ` x ) e. ( 1 ... ( N + 1 ) ) ) -> ( ( F ` ( F ` x ) ) = x -> ( `' F ` x ) = ( F ` x ) ) )
58	53, 56, 57	syl2anc 666	. . 3 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> ( ( F ` ( F ` x ) ) = x -> ( `' F ` x ) = ( F ` x ) ) )
59	52, 58	mpd 15	. 2 |- ( ( ph /\ x e. ( 1 ... ( N + 1 ) ) ) -> ( `' F ` x ) = ( F ` x ) )
60	15, 17, 59	eqfnfvd 5977	1 |- ( ph -> `' F = F )

Syntax hints:   -> wi 4   \/ wo 370   /\ wa 371   = wceq 1443   e. wcel 1886   {cab 2436   =/= wne 2621   A.wral 2736   {crab 2740   _Vcvv 3044   \ cdif 3400   u. cun 3401   i^i cin 3402   (/)c0 3730   {csn 3967   {cpr 3969   <.cop 3973   |-> cmpt 4460   _I cid 4743   `'ccnv 4832   |` cres 4835   Fn wfn 5576   -->wf 5577   -1-1-onto->wf1o 5580   ` cfv 5581  (class class class)co 6288   Fincfn 7566   1c1 9537   + caddc 9539   - cmin 9857   NNcn 10606   2c2 10656   NN0cn0 10866   ...cfz 11781   #chash 12512

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1668  ax-4 1681  ax-5 1757  ax-6 1804  ax-7 1850  ax-8 1888  ax-9 1895  ax-10 1914  ax-11 1919  ax-12 1932  ax-13 2090  ax-ext 2430  ax-rep 4514  ax-sep 4524  ax-nul 4533  ax-pow 4580  ax-pr 4638  ax-un 6580  ax-cnex 9592  ax-resscn 9593  ax-1cn 9594  ax-icn 9595  ax-addcl 9596  ax-addrcl 9597  ax-mulcl 9598  ax-mulrcl 9599  ax-mulcom 9600  ax-addass 9601  ax-mulass 9602  ax-distr 9603  ax-i2m1 9604  ax-1ne0 9605  ax-1rid 9606  ax-rnegex 9607  ax-rrecex 9608  ax-cnre 9609  ax-pre-lttri 9610  ax-pre-lttrn 9611  ax-pre-ltadd 9612  ax-pre-mulgt0 9613

This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3or 985  df-3an 986  df-tru 1446  df-ex 1663  df-nf 1667  df-sb 1797  df-eu 2302  df-mo 2303  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2580  df-ne 2623  df-nel 2624  df-ral 2741  df-rex 2742  df-reu 2743  df-rmo 2744  df-rab 2745  df-v 3046  df-sbc 3267  df-csb 3363  df-dif 3406  df-un 3408  df-in 3410  df-ss 3417  df-pss 3419  df-nul 3731  df-if 3881  df-pw 3952  df-sn 3968  df-pr 3970  df-tp 3972  df-op 3974  df-uni 4198  df-int 4234  df-iun 4279  df-br 4402  df-opab 4461  df-mpt 4462  df-tr 4497  df-eprel 4744  df-id 4748  df-po 4754  df-so 4755  df-fr 4792  df-we 4794  df-xp 4839  df-rel 4840  df-cnv 4841  df-co 4842  df-dm 4843  df-rn 4844  df-res 4845  df-ima 4846  df-pred 5379  df-ord 5425  df-on 5426  df-lim 5427  df-suc 5428  df-iota 5545  df-fun 5583  df-fn 5584  df-f 5585  df-f1 5586  df-fo 5587  df-f1o 5588  df-fv 5589  df-riota 6250  df-ov 6291  df-oprab 6292  df-mpt2 6293  df-om 6690  df-1st 6790  df-2nd 6791  df-wrecs 7025  df-recs 7087  df-rdg 7125  df-1o 7179  df-oadd 7183  df-er 7360  df-en 7567  df-dom 7568  df-sdom 7569  df-fin 7570  df-card 8370  df-cda 8595  df-pnf 9674  df-mnf 9675  df-xr 9676  df-ltxr 9677  df-le 9678  df-sub 9859  df-neg 9860  df-nn 10607  df-2 10665  df-n0 10867  df-z 10935  df-uz 11157  df-fz 11782  df-hash 12513

This theorem is referenced by:  subfacp1lem5  29900