Nuprl - Pf fin_dec

PrintForm Definitions finite sets Sections AutomataTheory Doc

1. n:
2. 0 < n
3. T:Type, B:(TProp). (f:((n-1)T), g:(T(n-1)). InvFuns((n-1); T; f; g)) & (t:T. Dec(B(t))) (m:, f:(m{t:T| B(t) }), g:({t:T| B(t) }m). InvFuns(m; {t:T| B(t) }; f; g))
4. T: Type
5. B: TProp
6. f: nT
7. g: Tn
8. g o f = Id
9. f o g = Id
10. t:T. Dec(B(t))

m:, f:(m{t:T| B(t) }), g:({t:T| B(t) }m). InvFuns(m; {t:T| B(t) }; f; g)

By: Assert (f (n-1){t:T| g(t) < n-1 })

Generated subgoals:

1 f (n-1){t:T| g(t) < n-1 }

2 11. f (n-1){t:T| g(t) < n-1 }
m:, f:(m{t:T| B(t) }), g:({t:T| B(t) }m). InvFuns(m; {t:T| B(t) }; f; g)

About:

1	`f (n-1){t:T\| g(t) < n-1 }`
2	11. `f (n-1){t:T\| g(t) < n-1 }` `m:, f:(m{t:T\| B(t) }), g:({t:T\| B(t) }m). InvFuns(m; {t:T\| B(t) }; f; g)`