[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 147 from proof rg2-lem2-term-unfair (previous step)

□ (R1(pm, S', S'') ∧ R2(pm, S', S'')), [:S | Boolvar ::- [PL N = n33 ∧ S = s33 ∧ N' = N'' + 1 until last ∧ R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf false ::- [PL N = n32 ∧ S = s32 ∧ □ ¬ N' < N'' ∧ ¬ □ R2(pm, S', S'')] ], □ (N = N' ∧ ¬ N' < N''), boolvar ∨ n2 = N0 + 1 ∧ N0 = N0'' + 1 until Boolvar, INDHYP-nat(n33 + 1) ∧ INDHYP-nat0(n2), R2(pm, s2, S), I(pm, s3), I(pm, s2), RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2), Pre1(pm, s), Pre2(pm, s), R1(pm, s3, S), R2(pm, s3, S), N ≤ n33 + 1, I(pm, s), G2(pm, s2, s2), G1(pm, s2, s3), R1(pm, s3, s33), n32 ≤ n33 + 1, R2(pm, s2, s3), R1(pm, s2, s2), I(pm, s33), I(pm, S), ¬ R2(pm, s2, s32), boolvar1 → s2 = s3 ∧ (boolvar ↔ boolvar0) ∧ n2 = n4 ⊦ [:S | [PL R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S')) ∧ (□ R1(pm, S', S'') → ◇ last)] ∥nf [PL S = s32]], ◇ last

User applied rule decompose

And closed the goal!

Rule argument

positions: 2, 1

Additional information