Proof of `Nondeterministic Turing machines as finite structures`
groundedproofs/Lax904597Proofs/Bridge.lean · lax-904597
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
An isomorphism of machine instances makes the two machines agree symbol by symbol, and agreement transports well-formedness and acceptance.