Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ι be given.
Let x1 of type ι be given.
Assume H0: SNo x0.
Assume H1: SNo x1.
Claim L2: ...
...
Claim L3: ∀ x2 . SNo x2SNoLev x2SNoLev (add_SNo x0 x1)SNoLt (add_SNo x0 x1) x2or (∃ x3 . and (x3SNoR x0) (SNoLe (add_SNo x3 x1) x2)) (∃ x3 . and (x3SNoR x1) (SNoLe (add_SNo x0 x3) x2))
Apply SNoLev_ind with λ x2 . SNoLev x2SNoLev (add_SNo x0 x1)SNoLt (add_SNo x0 x1) x2or (∃ x3 . and (x3SNoR x0) (SNoLe (add_SNo x3 x1) x2)) (∃ x3 . and (x3SNoR x1) (SNoLe (add_SNo x0 x3) x2)).
Let x2 of type ι be given.
Assume H3: SNo x2.
Assume H4: ∀ x3 . x3SNoS_ (SNoLev x2)SNoLev x3SNoLev (add_SNo x0 x1)SNoLt (add_SNo x0 x1) x3or (∃ x4 . and (x4SNoR x0) (SNoLe (add_SNo x4 x1) x3)) (∃ x4 . and (x4SNoR x1) (SNoLe (add_SNo x0 x4) x3)).
Assume H5: SNoLev x2SNoLev (add_SNo x0 x1).
Assume H6: SNoLt (add_SNo x0 x1) x2.
Apply dneg with or (∃ x3 . and (x3SNoR x0) (SNoLe (add_SNo x3 x1) x2)) (∃ x3 . and (x3SNoR x1) (SNoLe (add_SNo x0 x3) x2)).
Assume H7: not (or (∃ x3 . and (x3SNoR x0) (SNoLe (add_SNo x3 x1) x2)) (∃ x3 . and (x3SNoR x1) (SNoLe (add_SNo x0 x3) x2))).
Apply SNoLt_irref with x2.
Claim L8: SNoLe x2 (add_SNo x0 x1)
Apply add_SNo_eq with x0, x1, λ x3 x4 . SNoLe x2 x4 leaving 3 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H1.
Apply SNo_eta with ..., ... leaving 2 subgoals.
...
...
Apply SNoLeLt_tra with x2, add_SNo x0 x1, x2 leaving 5 subgoals.
The subproof is completed by applying H3.
The subproof is completed by applying L2.
The subproof is completed by applying H3.
The subproof is completed by applying L8.
The subproof is completed by applying H6.
Let x2 of type ι be given.
Assume H4: x2SNoR (add_SNo x0 x1).
Apply SNoR_E with add_SNo x0 x1, x2, or (∃ x3 . and (x3SNoR x0) (SNoLe (add_SNo x3 x1) x2)) (∃ x3 . and (x3SNoR x1) (SNoLe (add_SNo x0 x3) x2)) leaving 3 subgoals.
The subproof is completed by applying L2.
The subproof is completed by applying H4.
Assume H5: SNo x2.
Assume H6: SNoLev x2SNoLev (add_SNo x0 x1).
Assume H7: SNoLt (add_SNo x0 x1) x2.
Apply L3 with x2 leaving 3 subgoals.
The subproof is completed by applying H5.
The subproof is completed by applying H6.
The subproof is completed by applying H7.