ChopGroupImpCS

f ; f ; ; f f ChopGroupImpCS

The proof is by induction on the number of ¡chops¿.

Proof when no ¡chops¿:

1
f f

qed

Proof for at n occurrences of ¡chops¿ where n 1:

1
f ; ; f f
induction for n 1 ¡chops¿
2
f ; f ; ; f f ; f
3
f ; ff
4
f ; f ; ; f f
2, 3,ImpChain

qed

2024-08-03
Contact | Home | ITL home | Course | Proofs | Algebra | FL
© 1996-2024