Ignoring empty summands
Lax149335.EmptySummands · concepts/Lax149335/EmptySummands.lean · lax-149335
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Claim
Claim 6.6. Let , where is the empty constant, i.e. . Then is provably equivalent to the composition
Concept map
Lean source view on GitHub
| 1 | import Lax149335.EquationalTheory |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Ignoring empty summands |
| 6 | type: claim |
| 7 | --- |
| 8 | **Claim 6.6.** Let , where is the |
| 9 | empty constant, i.e. . Then is |
| 10 | provably equivalent to the composition |
| 11 | |
| 12 | |
| 13 | |
| 14 | |
| 15 | |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax149335.EmptySummands |
| 19 | |
| 20 | open Lax149335.Types Lax149335.Terms Lax149335.Terms.Term Lax149335.DerivedTerms |
| 21 | Lax149335.DerivedTerms.Term Lax149335.EquationalTheory |
| 22 | |
| 23 | /-- **Claim 6.6.** If the case `f_E` of a co-pairing is the empty constant, then `hom f` |
| 24 | factors through `hom f_N`. -/ |
| 25 | axiom hom_factors {B E N : Ty} (fE : Term E B⋆) (fN : Term N B⋆) |
| 26 | (hfE : fE ≡ₜ toUnit E ⨟ nilT B) : |
| 27 | homT (Term.either fE fN) ≡ₜ |
| 28 | (split E N ⨟ snd E⋆ ((N ⊗ E⋆)⋆) ⨟ listF (fst N E⋆) ⨟ homT fN) |
| 29 | |
| 30 | end Lax149335.EmptySummands |
| 31 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments