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

□ (N = N' ∧ ¬ N' < N''), [:S | Boolvar ::- [PL N = n50 ∧ S = s62 ∧ 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 = s61 ∧ N = n49 ∧ □ ¬ N' < N'' ∧ R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')) ∧ ¬ □ R2(pm, S', S'')] ], □ (R1(pm, S', S'') ∧ R2(pm, S', S'')), INDHYP-nat(n50 + 1) ∧ INDHYP-nat0(n50 + 1), N = n50 + 1, R2(pm, s3, S), R1(pm, s3, S), Pre2(pm, s), Pre1(pm, s), RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2), I(pm, s2), I(pm, s3), R2(pm, s2, S), I(pm, S), I(pm, s62), I(pm, s61), R1(pm, s2, s2), R2(pm, s2, s3), n49 ≤ n50 + 1, R1(pm, s3, s62), G1(pm, s2, s3), R2(pm, s2, s61), G2(pm, s2, s2), I(pm, s), boolvar1 → s2 = s3 ∧ boolvar0 ⊦ ◇ last

User applied rule insert proof lemma

And obtained the following new goals

Rule argument

path: 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 13, 5, 1, 1, 2, 1, 1, 1, 1 subst: [R1, pm, S, R2, N, Boolvar, n16, Post1, s, G1, Post2, G2, Pre2, Pre1, I] → [R1, pm, S, R2, N, Boolvar, n50, Post1, s, G1, Post2, G2, Pre2, Pre1, I]

Additional information