Metamath Proof Explorer


Theorem finxpreclem3

Description: Lemma for ^^ recursion theorems. (Contributed by ML, 20-Oct-2020)

Ref Expression
Hypothesis finxpreclem3.1 F = n ω , x V if n = 1 𝑜 x U if x V × U n 1 st x n x
Assertion finxpreclem3 N ω 2 𝑜 N X V × U N 1 st X = F N X

Proof

Step Hyp Ref Expression
1 finxpreclem3.1 F = n ω , x V if n = 1 𝑜 x U if x V × U n 1 st x n x
2 df-ov N F X = F N X
3 1 a1i N ω 2 𝑜 N X V × U F = n ω , x V if n = 1 𝑜 x U if x V × U n 1 st x n x
4 eqeq1 n = N n = 1 𝑜 N = 1 𝑜
5 eleq1 x = X x U X U
6 4 5 bi2anan9 n = N x = X n = 1 𝑜 x U N = 1 𝑜 X U
7 eleq1 x = X x V × U X V × U
8 7 adantl n = N x = X x V × U X V × U
9 unieq n = N n = N
10 9 adantr n = N x = X n = N
11 fveq2 x = X 1 st x = 1 st X
12 11 adantl n = N x = X 1 st x = 1 st X
13 10 12 opeq12d n = N x = X n 1 st x = N 1 st X
14 opeq12 n = N x = X n x = N X
15 8 13 14 ifbieq12d n = N x = X if x V × U n 1 st x n x = if X V × U N 1 st X N X
16 6 15 ifbieq2d n = N x = X if n = 1 𝑜 x U if x V × U n 1 st x n x = if N = 1 𝑜 X U if X V × U N 1 st X N X
17 sssucid 1 𝑜 suc 1 𝑜
18 df-2o 2 𝑜 = suc 1 𝑜
19 17 18 sseqtrri 1 𝑜 2 𝑜
20 1on 1 𝑜 On
21 18 20 sucneqoni 2 𝑜 1 𝑜
22 21 necomi 1 𝑜 2 𝑜
23 df-pss 1 𝑜 2 𝑜 1 𝑜 2 𝑜 1 𝑜 2 𝑜
24 19 22 23 mpbir2an 1 𝑜 2 𝑜
25 ssnpss 2 𝑜 1 𝑜 ¬ 1 𝑜 2 𝑜
26 24 25 mt2 ¬ 2 𝑜 1 𝑜
27 sseq2 N = 1 𝑜 2 𝑜 N 2 𝑜 1 𝑜
28 26 27 mtbiri N = 1 𝑜 ¬ 2 𝑜 N
29 28 con2i 2 𝑜 N ¬ N = 1 𝑜
30 29 intnanrd 2 𝑜 N ¬ N = 1 𝑜 X U
31 30 iffalsed 2 𝑜 N if N = 1 𝑜 X U if X V × U N 1 st X N X = if X V × U N 1 st X N X
32 iftrue X V × U if X V × U N 1 st X N X = N 1 st X
33 31 32 sylan9eq 2 𝑜 N X V × U if N = 1 𝑜 X U if X V × U N 1 st X N X = N 1 st X
34 16 33 sylan9eqr 2 𝑜 N X V × U n = N x = X if n = 1 𝑜 x U if x V × U n 1 st x n x = N 1 st X
35 34 adantlll N ω 2 𝑜 N X V × U n = N x = X if n = 1 𝑜 x U if x V × U n 1 st x n x = N 1 st X
36 simpll N ω 2 𝑜 N X V × U N ω
37 elex X V × U X V
38 37 adantl N ω 2 𝑜 N X V × U X V
39 opex N 1 st X V
40 39 a1i N ω 2 𝑜 N X V × U N 1 st X V
41 3 35 36 38 40 ovmpod N ω 2 𝑜 N X V × U N F X = N 1 st X
42 2 41 syl5reqr N ω 2 𝑜 N X V × U N 1 st X = F N X