[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 133 from proof rg2-lem1-term-unfair (previous step)

□ (R1(pm, S', S'') ∧ R2(pm, S', S'')), [:S | Boolvar ::- [PL N = n25 ∧ S = s33 ∧ N' = N'' + 1 until ¬ R1(pm, S', S'') ∧ R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf false ::- [PL S = s34 ∧ N = n26 ∧ □ ¬ N' < N'' ∧ R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')) ∧ ◇ last] ], □ (N = N' ∧ ¬ N' < N''), INDHYP-nat(n25 + 1) ∧ INDHYP-nat0(n25 + 1), R1(pm, s2, S), I(pm, s2), I(pm, s3), 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 ≤ n25 + 1, I(pm, s), G1(pm, s2, s2), R1(pm, s2, s33), G2(pm, s2, s3), R2(pm, s3, s34), n26 ≤ n25 + 1, R2(pm, s2, s2), R1(pm, s2, s3), I(pm, s33), I(pm, S), I(pm, s34), boolvar1 → s2 = s3 ∧ boolvar0 ⊦ ◇ last

User applied rule cut formula

And obtained the following new goals

Proof step 134:
□ (R1(pm, S', S'') ∧ R2(pm, S', S'')), [:S | Boolvar ::- [PL N = n25 ∧ S = s33 ∧ N' = N'' + 1 until ¬ R1(pm, S', S'') ∧ R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf false ::- [PL S = s34 ∧ N = n26 ∧ □ ¬ N' < N'' ∧ R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')) ∧ ◇ last] ], □ (N = N' ∧ ¬ N' < N''), INDHYP-nat(n25 + 1) ∧ INDHYP-nat0(n25 + 1), R1(pm, s2, S), I(pm, s2), I(pm, s3), 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 ≤ n25 + 1, I(pm, s), G1(pm, s2, s2), R1(pm, s2, s33), G2(pm, s2, s3), R2(pm, s3, s34), n26 ≤ n25 + 1, R2(pm, s2, s2), R1(pm, s2, s3), I(pm, s33), I(pm, S), I(pm, s34), boolvar1 → s2 = s3 ∧ boolvar0, N < n25 + 1 ⊦ ◇ last
Proof step 138:
□ (R1(pm, S', S'') ∧ R2(pm, S', S'')), [:S | Boolvar ::- [PL N = n25 ∧ S = s33 ∧ N' = N'' + 1 until ¬ R1(pm, S', S'') ∧ R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf false ::- [PL S = s34 ∧ N = n26 ∧ □ ¬ N' < N'' ∧ R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')) ∧ ◇ last] ], □ (N = N' ∧ ¬ N' < N''), INDHYP-nat(n25 + 1) ∧ INDHYP-nat0(n25 + 1), R1(pm, s2, S), I(pm, s2), I(pm, s3), 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 ≤ n25 + 1, I(pm, s), G1(pm, s2, s2), R1(pm, s2, s33), G2(pm, s2, s3), R2(pm, s3, s34), n26 ≤ n25 + 1, R2(pm, s2, s2), R1(pm, s2, s3), I(pm, s33), I(pm, S), I(pm, s34), boolvar1 → s2 = s3 ∧ boolvar0, ¬ N < n25 + 1 ⊦ ◇ last

Rule argument

fma: N < n25 + 1

Additional information

Used formulas: N < n25 + 1