Proof Step: c_0_20

name: c_0_20 syntax: thf role: plain inference: evalgc

Proof State Overview

proof_step c_0_2 ⊕ n = i c_0_15 ⊕ i = n c_0_2->c_0_15 c_0_20 ⊕ i = n c_0_15->c_0_20 c_0_27 ⊖ typing shift_type e n t2 app var n a foldr_type_type fun X7 t ⊖ typings shift_type e n t2 as X7 c_0_20->c_0_27 c_0_20->c_0_27 c_0_36 ⊕ typing shift_type e n t2 foldl_dB_dB app var n rs t c_0_20->c_0_36

Input Dependencies

c_0_2

Assumptions

c_0_15

Conclusion

c_0_20

Dependents

c_0_27 c_0_27 c_0_36

Formula

i = n

Source

inference(evalgc,[status(thm)],[c_0_15])