Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ιιο be given.
Assume H0: per_i x0.
Assume H1: ∀ x1 . combinator x1x0 x1 x1.
Assume H2: ∀ x1 x2 x3 x4 . combinator x1combinator x2combinator x3combinator x4combinator_equiv x1 x3x0 x1 x3combinator_equiv x2 x4x0 x2 x4x0 ((λ x5 x6 . Inj1 (setsum x5 x6)) x1 x2) ((λ x5 x6 . Inj1 (setsum x5 x6)) x3 x4).
Assume H3: ∀ x1 x2 . x0 ((λ x3 x4 . Inj1 (setsum x3 x4)) ((λ x3 x4 . Inj1 (setsum x3 x4)) (Inj0 0) x1) x2) x1.
Assume H4: ∀ x1 x2 x3 . x0 ((λ x4 x5 . Inj1 (setsum x4 x5)) ((λ x4 x5 . Inj1 (setsum x4 x5)) ((λ x4 x5 . Inj1 (setsum x4 x5)) (Inj0 (Power 0)) x1) x2) x3) ((λ x4 x5 . Inj1 (setsum x4 x5)) ((λ x4 x5 . Inj1 (setsum x4 x5)) x1 x3) ((λ x4 x5 . Inj1 (setsum x4 x5)) x2 x3)).
Apply unknownprop_5574bdb5e5df6f14031f4de95b01de091bd6680b3f0f837fce12fa18146d5760 with x0, ∀ x1 x2 . combinator_equiv x1 x2x0 x1 x2 leaving 2 subgoals.
The subproof is completed by applying H0.
Assume H5: symmetric_i x0.
Assume H6: transitive_i x0.
Let x1 of type ι be given.
Let x2 of type ι be given.
Apply unknownprop_6d861aa069d3c6b52ea4a1626e236a28ccef38ff01ec7a48d612e144c66b13b6 with λ x3 x4 : ι → ι → ο . x4 x1 x2x0 x1 x2.
Assume H7: (λ x3 x4 . ∀ x5 : ι → ι → ο . per_i x5(∀ x6 . combinator x6x5 x6 x6)(∀ x6 x7 x8 x9 . combinator x6combinator x7combinator x8combinator x9x5 x6 x8x5 x7 x9x5 (Inj1 (setsum x6 x7)) (Inj1 (setsum x8 x9)))(∀ x6 x7 . x5 (Inj1 (setsum (Inj1 (setsum (Inj0 0) x6)) x7)) x6)(∀ x6 x7 x8 . x5 (Inj1 (setsum (Inj1 (setsum (Inj1 (setsum (Inj0 (Power 0)) x6)) x7)) x8)) (Inj1 (setsum (Inj1 (setsum x6 x8)) (Inj1 (setsum x7 x8)))))x5 x3 x4) x1 x2.
Claim L8: and (combinator_equiv x1 x2) (x0 x1 x2)
Apply H7 with λ x3 x4 . and (combinator_equiv x3 x4) (x0 x3 x4) leaving 5 subgoals.
Apply unknownprop_3c590cab2ff9c9cfe8b972f88872dc13917f1366b105f7b06fc323fa84f097bb with λ x3 x4 . and (combinator_equiv x3 x4) (x0 x3 x4) leaving 2 subgoals.
Apply unknownprop_aec34b0d0cf76dca91d048e65b0ba169e2aa775687c2b9251cda71d8c85d19d1 with λ x3 x4 . and (combinator_equiv x3 x4) (x0 x3 x4).
Let x3 of type ι be given.
Let x4 of type ι be given.
Assume H8: (λ x5 x6 . and (combinator_equiv x5 x6) (x0 x5 x6)) x3 x4.
...
...
...
...
...
...
Apply unknownprop_896ccc9f209efa8a895211d65adb5a90348b419f100f6ab5e9762ce4d7fa9cc1 with combinator_equiv x1 x2, x0 x1 x2.
The subproof is completed by applying L8.