Theorem findcard 7158

Description: Schema for induction on the cardinality of a finite set. The inductive hypothesis is that the result is true on the given set with any one element removed. The result is then proven to be true for all finite sets. (Contributed by Jeff Madsen, 2-Sep-2009.)

Hypotheses

Ref	Expression
findcard.1	|- ( x = (/) -> ( ph <-> ps ) )
findcard.2	|- ( x = ( y \ { z } ) -> ( ph <-> ch ) )
findcard.3	|- ( x = y -> ( ph <-> th ) )
findcard.4	|- ( x = A -> ( ph <-> ta ) )
findcard.5	|- ps
findcard.6	|- ( y e. Fin -> ( A. z e. y ch -> th ) )

Assertion

Ref	Expression
findcard	|- ( A e. Fin -> ta )

Distinct variable groups:   x, y, z, A   ps, x   ch, x   th, x   ta, x   ph, y, z

Allowed substitution hints:   ph( x)   ps( y, z)   ch( y, z)   th( y, z)   ta( y, z)

Proof of Theorem findcard

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

Step	Hyp	Ref	Expression
1		findcard.4	. 2 |- ( x = A -> ( ph <-> ta ) )
2		isfi 7013	. . 3 |- ( x e. Fin <-> E. w e. om x ~~ w )
3		breq2 4118	. . . . . . . 8 |- ( w = (/) -> ( x ~~ w <-> x ~~ (/) ) )
4	3	imbi1d 231	. . . . . . 7 |- ( w = (/) -> ( ( x ~~ w -> ph ) <-> ( x ~~ (/) -> ph ) ) )
5	4	albidv 1873	. . . . . 6 |- ( w = (/) -> ( A. x ( x ~~ w -> ph ) <-> A. x ( x ~~ (/) -> ph ) ) )
6		breq2 4118	. . . . . . . 8 |- ( w = v -> ( x ~~ w <-> x ~~ v ) )
7	6	imbi1d 231	. . . . . . 7 |- ( w = v -> ( ( x ~~ w -> ph ) <-> ( x ~~ v -> ph ) ) )
8	7	albidv 1873	. . . . . 6 |- ( w = v -> ( A. x ( x ~~ w -> ph ) <-> A. x ( x ~~ v -> ph ) ) )
9		breq2 4118	. . . . . . . 8 |- ( w = suc v -> ( x ~~ w <-> x ~~ suc v ) )
10	9	imbi1d 231	. . . . . . 7 |- ( w = suc v -> ( ( x ~~ w -> ph ) <-> ( x ~~ suc v -> ph ) ) )
11	10	albidv 1873	. . . . . 6 |- ( w = suc v -> ( A. x ( x ~~ w -> ph ) <-> A. x ( x ~~ suc v -> ph ) ) )
12		en0 7048	. . . . . . . 8 |- ( x ~~ (/) <-> x = (/) )
13		findcard.5	. . . . . . . . 9 |- ps
14		findcard.1	. . . . . . . . 9 |- ( x = (/) -> ( ph <-> ps ) )
15	13, 14	mpbiri 168	. . . . . . . 8 |- ( x = (/) -> ph )
16	12, 15	sylbi 121	. . . . . . 7 |- ( x ~~ (/) -> ph )
17	16	ax-gen 1498	. . . . . 6 |- A. x ( x ~~ (/) -> ph )
18		peano2 4722	. . . . . . . . . . . . 13 |- ( v e. om -> suc v e. om )
19		breq2 4118	. . . . . . . . . . . . . 14 |- ( w = suc v -> ( y ~~ w <-> y ~~ suc v ) )
20	19	rspcev 2923	. . . . . . . . . . . . 13 |- ( ( suc v e. om /\ y ~~ suc v ) -> E. w e. om y ~~ w )
21	18, 20	sylan 283	. . . . . . . . . . . 12 |- ( ( v e. om /\ y ~~ suc v ) -> E. w e. om y ~~ w )
22		isfi 7013	. . . . . . . . . . . 12 |- ( y e. Fin <-> E. w e. om y ~~ w )
23	21, 22	sylibr 134	. . . . . . . . . . 11 |- ( ( v e. om /\ y ~~ suc v ) -> y e. Fin )
24	23	3adant2 1043	. . . . . . . . . 10 |- ( ( v e. om /\ A. x ( x ~~ v -> ph ) /\ y ~~ suc v ) -> y e. Fin )
25		dif1en 7149	. . . . . . . . . . . . . . . 16 |- ( ( v e. om /\ y ~~ suc v /\ z e. y ) -> ( y \ { z } ) ~~ v )
26	25	3expa 1230	. . . . . . . . . . . . . . 15 |- ( ( ( v e. om /\ y ~~ suc v ) /\ z e. y ) -> ( y \ { z } ) ~~ v )
27		vex 2818	. . . . . . . . . . . . . . . . 17 |- y e. _V
28		difexg 4257	. . . . . . . . . . . . . . . . 17 |- ( y e. _V -> ( y \ { z } ) e. _V )
29	27, 28	ax-mp 5	. . . . . . . . . . . . . . . 16 |- ( y \ { z } ) e. _V
30		breq1 4117	. . . . . . . . . . . . . . . . 17 |- ( x = ( y \ { z } ) -> ( x ~~ v <-> ( y \ { z } ) ~~ v ) )
31		findcard.2	. . . . . . . . . . . . . . . . 17 |- ( x = ( y \ { z } ) -> ( ph <-> ch ) )
32	30, 31	imbi12d 234	. . . . . . . . . . . . . . . 16 |- ( x = ( y \ { z } ) -> ( ( x ~~ v -> ph ) <-> ( ( y \ { z } ) ~~ v -> ch ) ) )
33	29, 32	spcv 2913	. . . . . . . . . . . . . . 15 |- ( A. x ( x ~~ v -> ph ) -> ( ( y \ { z } ) ~~ v -> ch ) )
34	26, 33	syl5com 29	. . . . . . . . . . . . . 14 |- ( ( ( v e. om /\ y ~~ suc v ) /\ z e. y ) -> ( A. x ( x ~~ v -> ph ) -> ch ) )
35	34	ralrimdva 2624	. . . . . . . . . . . . 13 |- ( ( v e. om /\ y ~~ suc v ) -> ( A. x ( x ~~ v -> ph ) -> A. z e. y ch ) )
36	35	imp 124	. . . . . . . . . . . 12 |- ( ( ( v e. om /\ y ~~ suc v ) /\ A. x ( x ~~ v -> ph ) ) -> A. z e. y ch )
37	36	an32s 570	. . . . . . . . . . 11 |- ( ( ( v e. om /\ A. x ( x ~~ v -> ph ) ) /\ y ~~ suc v ) -> A. z e. y ch )
38	37	3impa 1221	. . . . . . . . . 10 |- ( ( v e. om /\ A. x ( x ~~ v -> ph ) /\ y ~~ suc v ) -> A. z e. y ch )
39		findcard.6	. . . . . . . . . 10 |- ( y e. Fin -> ( A. z e. y ch -> th ) )
40	24, 38, 39	sylc 62	. . . . . . . . 9 |- ( ( v e. om /\ A. x ( x ~~ v -> ph ) /\ y ~~ suc v ) -> th )
41	40	3exp 1229	. . . . . . . 8 |- ( v e. om -> ( A. x ( x ~~ v -> ph ) -> ( y ~~ suc v -> th ) ) )
42	41	alrimdv 1925	. . . . . . 7 |- ( v e. om -> ( A. x ( x ~~ v -> ph ) -> A. y ( y ~~ suc v -> th ) ) )
43		breq1 4117	. . . . . . . . 9 |- ( x = y -> ( x ~~ suc v <-> y ~~ suc v ) )
44		findcard.3	. . . . . . . . 9 |- ( x = y -> ( ph <-> th ) )
45	43, 44	imbi12d 234	. . . . . . . 8 |- ( x = y -> ( ( x ~~ suc v -> ph ) <-> ( y ~~ suc v -> th ) ) )
46	45	cbvalv 1969	. . . . . . 7 |- ( A. x ( x ~~ suc v -> ph ) <-> A. y ( y ~~ suc v -> th ) )
47	42, 46	imbitrrdi 162	. . . . . 6 |- ( v e. om -> ( A. x ( x ~~ v -> ph ) -> A. x ( x ~~ suc v -> ph ) ) )
48	5, 8, 11, 17, 47	finds1 4729	. . . . 5 |- ( w e. om -> A. x ( x ~~ w -> ph ) )
49	48	19.21bi 1607	. . . 4 |- ( w e. om -> ( x ~~ w -> ph ) )
50	49	rexlimiv 2656	. . 3 |- ( E. w e. om x ~~ w -> ph )
51	2, 50	sylbi 121	. 2 |- ( x e. Fin -> ph )
52	1, 51	vtoclga 2883	1 |- ( A e. Fin -> ta )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   A.wal 1396   = wceq 1398   e. wcel 2205   A.wral 2522   E.wrex 2523   _Vcvv 2815   \ cdif 3211   (/)c0 3512   {csn 3694   class class class wbr 4114   suc csuc 4491   omcom 4717   ~~ cen 6986   Fincfn 6988

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-er 6780  df-en 6989  df-fin 6991

This theorem is referenced by:  xpfi  7205