1 |
( f.<f(a-1),f>) ( a inj b) (i: b (a-1) inj {x: b| x = i })
 | 3 steps |
2 |
3. ( f.<f(a-1),f>) ( a inj b) (i: b (a-1) inj {x: b| x = i })
( ie.ie/i,e. x.if x= a-1 i else e(x) fi)
(i: b (a-1) inj {x: b| x = i })  a inj b
 | 2 steps |
3 |
3. ( f.<f(a-1),f>) ( a inj b) (i: b (a-1) inj {x: b| x = i })
4. ( ie.ie/i,e. x.if x= a-1 i else e(x) fi)
4. (i: b (a-1) inj {x: b| x = i })  a inj b
InvFuns( a inj b;i: b (a-1) inj {x: b| x = i }
InvFuns; f.<f(a-1),f>; ie.ie/i,e. x.if x= a-1 i else e(x) fi)
 | 22 steps |