Section IterSepconRules.
Context {L: Language}
{minL: MinimumLanguage L}
{pL: PropositionalLanguage L}
{sepconL: SepconLanguage L}
{wandL: WandLanguage L}
{empL: EmpLanguage L}
{iter_sepcon_L: IterSepconLanguage L}
{iter_wand_L: IterWandLanguage L}
{iter_sepcon_Def: NormalIterSepcon L}
{iter_wand_Def: NormalIterWand L}
{Gamma: Provable L}
{minAX: MinimumAxiomatization L Gamma}
{ipAX: IntuitionisticPropositionalLogic L Gamma}
{sepconAX: SepconAxiomatization L Gamma}
{wandAX: WandAxiomatization L Gamma}
{empAX: EmpAxiomatization L Gamma}.

Lemma sepcon_iter_unfold_right_assoc:
forall xs,
|-- iter_sepcon xs <-->
(fix f xs :=
match xs with
| nil => emp
| cons x nil => x
| cons x xs0 => x * f xs0
end) xs.