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

□ (R1(pm, S', S'') ∧ R2(pm, S', S'')), □ (N = N' ∧ ¬ N' < N''), [:S | Boolvar ::- [PL N = n16 ∧ N' = N'' + 1 until ¬ R1(pm, S', S'') ∧ R1(pm, S', S'') -+-> (last ⊃ Post1(pm, s, S);G1(pm, S, S'))] ∥nf false ::- [PL □ ¬ N' < N'' ∧ R2(pm, S', S'') -+-> (last ⊃ Post2(pm, s, S);G2(pm, S, S')) ∧ (□ R2(pm, S', S'') → ◇ last)] ], INDHYP-nat(n16 + 1) ∧ INDHYP-nat0(n16 + 1), N = n16 + 1, Pre2(pm, s), Pre1(pm, s), RG-restr(pm, R1, G1, Pre1, Post1, I, R2, G2, Pre2, Post2), I(pm, S) ⊦ ◇ last

Proof step 60 used as proof-lemma