Metamath Proof Explorer


Theorem bnj517

Description: Technical lemma for bnj518 . This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011) (Proof shortened by Mario Carneiro, 22-Dec-2016) (New usage is discouraged.)

Ref Expression
Hypotheses bnj517.1 φF=predXAR
bnj517.2 ψiωsuciNFsuci=yFipredyAR
Assertion bnj517 NωφψnNFnA

Proof

Step Hyp Ref Expression
1 bnj517.1 φF=predXAR
2 bnj517.2 ψiωsuciNFsuci=yFipredyAR
3 fveq2 m=Fm=F
4 simpl2 NωφψmNφ
5 4 1 sylib NωφψmNF=predXAR
6 3 5 sylan9eqr NωφψmNm=Fm=predXAR
7 bnj213 predXARA
8 6 7 eqsstrdi NωφψmNm=FmA
9 r19.29r iωm=suciiωsuciNFsuci=yFipredyARiωm=sucisuciNFsuci=yFipredyAR
10 eleq1 m=sucimNsuciN
11 10 biimpd m=sucimNsuciN
12 fveqeq2 m=suciFm=yFipredyARFsuci=yFipredyAR
13 bnj213 predyARA
14 13 rgenw yFipredyARA
15 iunss yFipredyARAyFipredyARA
16 14 15 mpbir yFipredyARA
17 sseq1 Fm=yFipredyARFmAyFipredyARA
18 16 17 mpbiri Fm=yFipredyARFmA
19 12 18 syl6bir m=suciFsuci=yFipredyARFmA
20 11 19 imim12d m=sucisuciNFsuci=yFipredyARmNFmA
21 20 imp m=sucisuciNFsuci=yFipredyARmNFmA
22 21 rexlimivw iωm=sucisuciNFsuci=yFipredyARmNFmA
23 9 22 syl iωm=suciiωsuciNFsuci=yFipredyARmNFmA
24 23 ex iωm=suciiωsuciNFsuci=yFipredyARmNFmA
25 24 com3l iωsuciNFsuci=yFipredyARmNiωm=suciFmA
26 2 25 sylbi ψmNiωm=suciFmA
27 26 3ad2ant3 NωφψmNiωm=suciFmA
28 27 imp31 NωφψmNiωm=suciFmA
29 simpr NωφψmNmN
30 simpl1 NωφψmNNω
31 elnn mNNωmω
32 29 30 31 syl2anc NωφψmNmω
33 nn0suc mωm=iωm=suci
34 32 33 syl NωφψmNm=iωm=suci
35 8 28 34 mpjaodan NωφψmNFmA
36 35 ralrimiva NωφψmNFmA
37 fveq2 m=nFm=Fn
38 37 sseq1d m=nFmAFnA
39 38 cbvralvw mNFmAnNFnA
40 36 39 sylib NωφψnNFnA