Theorem findsg 2398

Description: Principle of Finite Induction (inference schema) with implicit substitutions. The first four hypotheses establish the substitutions we need. The last two are the basis and the induction hypothesis. The basis of this version is an arbitrary natural number B instead of zero.

Hypotheses

Ref	Expression
findsg.1	|- (x = B -> (ph <-> ps))
findsg.2	|- (x = y -> (ph <-> ch))
findsg.3	|- (x = suc y -> (ph <-> th))
findsg.4	|- (x = A -> (ph <-> ta ))
findsg.5	|- (B e. om -> ps)
findsg.6	|- (((y e. om /\ B e. om) /\ B (_ y) -> (ch -> th))

Assertion

Ref	Expression
findsg	|- (((A e. om /\ B e. om) /\ B (_ A) -> ta )

Distinct variable group(s):   x,A   x,y,B   ps,x   ch,x   th,x   ta ,x   ph,y

Proof of Theorem findsg

Step	Hyp	Ref	Expression
1		sseq2 1522	. . . . . . 7 |- (x = (/) -> (B (_ x <-> B (_ (/)))
2	1	adantl 305	. . . . . 6 |- ((B = (/) /\ x = (/)) -> (B (_ x <-> B (_ (/)))
3		cleq2 1110	. . . . . . . 8 |- (B = (/) -> (x = B <-> x = (/)))
4		findsg.1	. . . . . . . 8 |- (x = B -> (ph <-> ps))
5	3, 4	syl6bir 188	. . . . . . 7 |- (B = (/) -> (x = (/) -> (ph <-> ps)))
6	5	imp 277	. . . . . 6 |- ((B = (/) /\ x = (/)) -> (ph <-> ps))
7	2, 6	imbi12d 474	. . . . 5 |- ((B = (/) /\ x = (/)) -> ((B (_ x -> ph) <-> (B (_ (/) -> ps)))
8	1	imbi1d 465	. . . . . 6 |- (x = (/) -> ((B (_ x -> ph) <-> (B (_ (/) -> ph)))
9		ss0 1727	. . . . . . . . 9 |- (B (_ (/) -> B = (/))
10	9	con3i 90	. . . . . . . 8 |- (-. B = (/) -> -. B (_ (/))
11	10	pm2.21d 74	. . . . . . 7 |- (-. B = (/) -> (B (_ (/) -> (ph <-> ps)))
12	11	pm5.74d 444	. . . . . 6 |- (-. B = (/) -> ((B (_ (/) -> ph) <-> (B (_ (/) -> ps)))
13	8, 12	sylan9bbr 419	. . . . 5 |- ((-. B = (/) /\ x = (/)) -> ((B (_ x -> ph) <-> (B (_ (/) -> ps)))
14	7, 13	pm2.61an1 364	. . . 4 |- (x = (/) -> ((B (_ x -> ph) <-> (B (_ (/) -> ps)))
15	14	imbi2d 464	. . 3 |- (x = (/) -> ((B e. om -> (B (_ x -> ph)) <-> (B e. om -> (B (_ (/) -> ps))))
16		sseq2 1522	. . . . 5 |- (x = y -> (B (_ x <-> B (_ y))
17		findsg.2	. . . . 5 |- (x = y -> (ph <-> ch))
18	16, 17	imbi12d 474	. . . 4 |- (x = y -> ((B (_ x -> ph) <-> (B (_ y -> ch)))
19	18	imbi2d 464	. . 3 |- (x = y -> ((B e. om -> (B (_ x -> ph)) <-> (B e. om -> (B (_ y -> ch))))
20		sseq2 1522	. . . . 5 |- (x = suc y -> (B (_ x <-> B (_ suc y))
21		findsg.3	. . . . 5 |- (x = suc y -> (ph <-> th))
22	20, 21	imbi12d 474	. . . 4 |- (x = suc y -> ((B (_ x -> ph) <-> (B (_ suc y -> th)))
23	22	imbi2d 464	. . 3 |- (x = suc y -> ((B e. om -> (B (_ x -> ph)) <-> (B e. om -> (B (_ suc y -> th))))
24		sseq2 1522	. . . . 5 |- (x = A -> (B (_ x <-> B (_ A))
25		findsg.4	. . . . 5 |- (x = A -> (ph <-> ta ))
26	24, 25	imbi12d 474	. . . 4 |- (x = A -> ((B (_ x -> ph) <-> (B (_ A -> ta )))
27	26	imbi2d 464	. . 3 |- (x = A -> ((B e. om -> (B (_ x -> ph)) <-> (B e. om -> (B (_ A -> ta ))))
28		findsg.5	. . . 4 |- (B e. om -> ps)
29	28	a1d 14	. . 3 |- (B e. om -> (B (_ (/) -> ps))
30		visset 1350	. . . . . . . . . . . . . 14 |- y e. V
31	30	sucex 2303	. . . . . . . . . . . . 13 |- suc y e. V
32	31	eqvinc 1407	. . . . . . . . . . . 12 |- (suc y = B <-> E.x(x = suc y /\ x = B))
33	4, 28	syl5bir 184	. . . . . . . . . . . . . 14 |- (x = B -> (B e. om -> ph))
34	21	biimpd 135	. . . . . . . . . . . . . 14 |- (x = suc y -> (ph -> th))
35	33, 34	sylan9r 360	. . . . . . . . . . . . 13 |- ((x = suc y /\ x = B) -> (B e. om -> th))
36	35	19.23aiv 952	. . . . . . . . . . . 12 |- (E.x(x = suc y /\ x = B) -> (B e. om -> th))
37	32, 36	sylbi 174	. . . . . . . . . . 11 |- (suc y = B -> (B e. om -> th))
38	37	cleqcoms 1104	. . . . . . . . . 10 |- (B = suc y -> (B e. om -> th))
39	38	syl3 18	. . . . . . . . 9 |- ((B (_ suc y -> B = suc y) -> (B (_ suc y -> (B e. om -> th)))
40	39	a1d 14	. . . . . . . 8 |- ((B (_ suc y -> B = suc y) -> ((B (_ y -> ch) -> (B (_ suc y -> (B e. om -> th))))
41	40	com4r 41	. . . . . . 7 |- (B e. om -> ((B (_ suc y -> B = suc y) -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
42	41	adantl 305	. . . . . 6 |- ((y e. om /\ B e. om) -> ((B (_ suc y -> B = suc y) -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
43		onsssuc 2311	. . . . . . . . . . 11 |- ((B e. On /\ y e. On) -> (B (_ y <-> B e. suc y))
44		onelpsst 2253	. . . . . . . . . . . 12 |- ((B e. On /\ suc y e. On) -> (B e. suc y <-> (B (_ suc y /\ -. B = suc y)))
45		suceloni 2314	. . . . . . . . . . . 12 |- (y e. On -> suc y e. On)
46	44, 45	sylan2 346	. . . . . . . . . . 11 |- ((B e. On /\ y e. On) -> (B e. suc y <-> (B (_ suc y /\ -. B = suc y)))
47	43, 46	bitrd 406	. . . . . . . . . 10 |- ((B e. On /\ y e. On) -> (B (_ y <-> (B (_ suc y /\ -. B = suc y)))
48		nnont 2379	. . . . . . . . . 10 |- (B e. om -> B e. On)
49		nnont 2379	. . . . . . . . . 10 |- (y e. om -> y e. On)
50	47, 48, 49	syl2an 349	. . . . . . . . 9 |- ((B e. om /\ y e. om) -> (B (_ y <-> (B (_ suc y /\ -. B = suc y)))
51	50	ancoms 334	. . . . . . . 8 |- ((y e. om /\ B e. om) -> (B (_ y <-> (B (_ suc y /\ -. B = suc y)))
52		findsg.6	. . . . . . . . . . . 12 |- (((y e. om /\ B e. om) /\ B (_ y) -> (ch -> th))
53	52	exp 291	. . . . . . . . . . 11 |- ((y e. om /\ B e. om) -> (B (_ y -> (ch -> th)))
54		ax-1 3	. . . . . . . . . . 11 |- (th -> (B (_ suc y -> th))
55	53, 54	syl8 25	. . . . . . . . . 10 |- ((y e. om /\ B e. om) -> (B (_ y -> (ch -> (B (_ suc y -> th))))
56	55	a2d 15	. . . . . . . . 9 |- ((y e. om /\ B e. om) -> ((B (_ y -> ch) -> (B (_ y -> (B (_ suc y -> th))))
57	56	com23 32	. . . . . . . 8 |- ((y e. om /\ B e. om) -> (B (_ y -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
58	51, 57	sylbird 180	. . . . . . 7 |- ((y e. om /\ B e. om) -> ((B (_ suc y /\ -. B = suc y) -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
59		annim 206	. . . . . . 7 |- ((B (_ suc y /\ -. B = suc y) <-> -. (B (_ suc y -> B = suc y))
60	58, 59	syl5ibr 182	. . . . . 6 |- ((y e. om /\ B e. om) -> (-. (B (_ suc y -> B = suc y) -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
61	42, 60	pm2.61d 112	. . . . 5 |- ((y e. om /\ B e. om) -> ((B (_ y -> ch) -> (B (_ suc y -> th)))
62	61	exp 291	. . . 4 |- (y e. om -> (B e. om -> ((B (_ y -> ch) -> (B (_ suc y -> th))))
63	62	a2d 15	. . 3 |- (y e. om -> ((B e. om -> (B (_ y -> ch)) -> (B e. om -> (B (_ suc y -> th))))
64	15, 19, 23, 27, 29, 63	finds 2397	. 2 |- (A e. om -> (B e. om -> (B (_ A -> ta )))
65	64	imp31 280	1 |- (((A e. om /\ B e. om) /\ B (_ A) -> ta )

Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   /\ wa 196  E.wex 678   = weq 797   = wceq 1091   e. wcel 1092   (_ wss 1487  (/)c0 1707  Oncon0 2199  suc csuc 2201  omcom 2372

This theorem is referenced by:  nnmordi 3188  inf3lem5 3468  indpi 3828

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373

metamath.org