reach-n-split-lereachable-n(H, n, r, r0), m ≤ n ⊦ ∃ r1. reachable-n(H, m, r, r1) ∧ reachable-n(H, n - m, r1, r0)reachable-n-basereach-n-split
11reach-n-split-le-proofreach-n-split-le-proof-info
The proof is valid.
../../../../specs/nat/export/unit.xmlnat../../../../specs/nat/export/lels/longlemmainfo.xmllels../../../../specs/nat/export/unit.xmlnat../../../../specs/nat/export/anti/longlemmainfo.xmlanti../../../../specs/nat/export/unit.xmlnat../../../../specs/nat/export/ler/longlemmainfo.xmller../../../../specs/nat/export/unit.xmlnat../../../../specs/nat/export/zero/longlemmainfo.xmlzero