[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 1 from proof cont-rel-thm (conclusion) (back to tree)

⊦ pcont(lift(alp))(f) ∧ mon(⌜λ n. ⌜alf(n)⌝ ⌝ ) ∧ (∀ n. alp(alf(n))) ∧ lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )) ∧ pfxclosed(alp) → lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) = f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ ))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pcont(lift(alp))(f), pfxclosed(alp), ∀ n. alp(alf(n)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:cont-relative-thm, seq:⊦ pcont(αp)(f) ∧ mon(⌜αf⌝ ) ∧ (∀ n. αp(αf(n))) ∧ αp(lim(⌜αf⌝ )) ∧ pfxclosed(αp) → lim(⌜λ n. f(αf(n))⌝ ) = f(lim(⌜αf⌝ )), subst:[αp, f, αf] → [lift(alp), f, λ n. ⌜alf(n)⌝ ]; [A, B] → [A, B]

Additional information

Used terms: lift(alp), f, λ n. ⌜alf(n)⌝

Proof step 3 from proof cont-rel-thm (previous step) (back to tree)

⊦ pcont(αp)(f) ∧ mon(⌜αf⌝ ) ∧ (∀ n. αp(αf(n))) ∧ αp(lim(⌜αf⌝ )) ∧ pfxclosed(αp) → lim(⌜λ n. f(αf(n))⌝ ) = f(lim(⌜αf⌝ ))

Lemma cont-relative-thm

Proof step 4 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pcont(lift(alp))(f), pfxclosed(alp), pcont(lift(alp))(f) ∧ mon(⌜λ n. ⌜alf(n)⌝ ⌝ ) ∧ (∀ n. lift(alp)(⌜alf(n)⌝ )) ∧ lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )) ∧ pfxclosed(lift(alp)) → lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) = f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: cont-relative-def: ⊦ pcont(αp)(f) ↔ pmon(αp)(f) ∧ ppbd(αp)(f); mon-relative-def: ⊦ pmon(αp)(f) ↔ (∀ α1, α2. αp(α1) ∧ αp(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2));

Proof step 5 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pfxclosed(alp), ppbd(lift(alp))(f), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2) ⊦ lift(alp)(⌜alf(n)⌝ ) ∧ pfxclosed(lift(alp))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 6 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pfxclosed(alp), ppbd(lift(alp))(f), ¬ lift(alp)(⌜alf(n)⌝ ), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:lift-pred-fin, seq: ⊦ lift(alp)(⌜al⌝ ) ↔ alp(al), subst:[alp, al] → [alp, alf(n)]; [A] → [A], lhs:lift(alp)(⌜alf(n)⌝ ), <all paths>

Additional information

Used terms: alp, alf(n)

Proof step 7 from proof cont-rel-thm (previous step) (back to tree)

⊦ lift(alp)(⌜al⌝ ) ↔ alp(al)

Lemma lift-pred-fin

Proof step 8 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pfxclosed(alp), ppbd(lift(alp))(f), ¬ alp(alf(n)), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: n

Additional information

Used terms: n

Proof step 9 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), pfxclosed(alp), ppbd(lift(alp))(f), ¬ pfxclosed(lift(alp)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:pfxclosedl-def, seq: ⊦ pfxclosed(alp) ↔ (∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1)), subst:[alp] → [alp]; [A] → [A], lhs:pfxclosed(alp), <all paths>

Additional information

Used terms: alp

Proof step 10 from proof cont-rel-thm (previous step) (back to tree)

⊦ pfxclosed(alp) ↔ (∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1))

Lemma pfxclosedl-def

Proof step 11 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ¬ pfxclosed(lift(alp)), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:pfxclosed-def, seq: ⊦ pfxclosed(αp) ↔ (∀ α1, α2. αp(α2) ∧ α1 ⊑ α2 → αp(α1)), subst:[αp] → [lift(alp)]; [A] → [A], lhs:pfxclosed(lift(alp)), <all paths>

Additional information

Used terms: lift(alp)

Proof step 12 from proof cont-rel-thm (previous step) (back to tree)

⊦ pfxclosed(αp) ↔ (∀ α1, α2. αp(α2) ∧ α1 ⊑ α2 → αp(α1))

Lemma pfxclosed-def

Proof step 13 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)), ∃ α1, α2. ¬(lift(alp)(α2) ∧ α1 ⊑ α2 → lift(alp)(α1)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), α1 ⊑ α2, ¬ lift(alp)(α1), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α1

Additional information

Used simplifier rules: Stream[A] freely generated by ⌝, ⌝;

Proof step 15 from proof cont-rel-thm (previous step) (back to tree)

α1 = ⌜al⌝ , lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), α1 ⊑ α2, ¬ lift(alp)(α1), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lift-pred-fin: ⊦ lift(alp)(⌜al⌝ ) ↔ alp(al);

Proof step 16 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ α2, ¬ alp(al), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α2

Additional information

Used simplifier rules: Stream[A] freely generated by ⌝, ⌝;

Proof step 17 from proof cont-rel-thm (previous step) (back to tree)

α2 = ⌜al0⌝ , lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ α2, ¬ alp(al), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lift-pred-fin: ⊦ lift(alp)(⌜al⌝ ) ↔ alp(al); ⊦ ⌜x⌝ ⊑ ⌜y⌝ ↔ x ⊑ y; (s)

Proof step 18 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), alp(al0), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), al ⊑ al0, ¬ alp(al), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: al, al0

Additional information

Used terms: al, al0

Proof step 19 from proof cont-rel-thm (previous step) (back to tree)

α2 = ⌜af⌝ , lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ α2, ¬ alp(al), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lift-pred-inf: ⊦ lift(alp)(⌜af⌝ ) ↔ (∀ n. alp(af.take(n)));

Proof step 20 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ ⌜af⌝ , ¬ alp(al), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ n. alp(af.take(n)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: # al abort: F discard: T computed: F

Additional information

Used terms: # al

Proof step 21 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), alp(af.take(# al)), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ ⌜af⌝ , ¬ alp(al), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream, name:elim-fromto-inf, seq: ⊦ x0 = nf.take(n) ∧ nf0 = nf.drop(n) ↔ nf = (⌜x0⌝ + ⌜nf0⌝ ).f ∧ # x0 = n, subst:[nf, n, x0, nf0] → [af, # al, al0, nf0]; [A] → [A]

Additional information

Used simplifier rules: ⊦ x0 = nf.take(n) ∧ nf0 = nf.drop(n) ↔ nf = (⌜x0⌝ + ⌜nf0⌝ ).f ∧ # x0 = n; (elim) Used terms: af, # al, al0, nf0

Proof step 22 from proof cont-rel-thm (previous step) (back to tree)

# al0 = # al, af = (⌜al0⌝ + ⌜nf0⌝ ).f, lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), alp(al0), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ ⌜af⌝ , ¬ alp(al), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x + nf⌝ = ⌜x⌝ + ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜nf⌝ ).f = x + nf; (s)

Proof step 23 from proof cont-rel-thm (previous step) (back to tree)

# al0 = # al, lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), alp(al0), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜al⌝ ⊑ ⌜al0⌝ + ⌜nf0⌝ , ¬ alp(al), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream, name:prefix-def, seq: ⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0), subst:[σ, σ0] → [⌜al⌝ , ⌜al0⌝ + ⌜nf0⌝ ]; [A] → [A], lhs:⌜al⌝ ⊑ ⌜al0⌝ + ⌜nf0⌝ , <all paths>

Additional information

Used simplifier rules: ⊦ # x = # y → (⌜x⌝ + σ = ⌜y⌝ + σ0 ↔ x = y ∧ σ = σ0); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream Used terms: ⌜al⌝ , ⌜al0⌝ + ⌜nf0⌝

Proof step 24 from proof cont-rel-thm (previous step) (back to tree)

⊦ σ ⊑ σ0 ↔ (∃ σ1. σ + σ1 = σ0)

A spec-lemma

Proof step 25 from proof cont-rel-thm (previous step) (back to tree)

α1 = ⌜af⌝ , lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), α1 ⊑ α2, ¬ lift(alp)(α1), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lift-pred-inf: ⊦ lift(alp)(⌜af⌝ ) ↔ (∀ n. alp(af.take(n)));

Proof step 26 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜af⌝ ⊑ α2, ¬ alp(af.take(n)), ∀ n. alp(alf(n)), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α2

Additional information

Used simplifier rules: Stream[A] freely generated by ⌝, ⌝; ⊦ ¬ ⌜nf⌝ ⊑ ⌜x⌝ ; (s)

Proof step 27 from proof cont-rel-thm (previous step) (back to tree)

α2 = ⌜af0⌝ , lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(α2), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ⌜af⌝ ⊑ α2, ¬ alp(af.take(n)), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lift-pred-inf: ⊦ lift(alp)(⌜af⌝ ) ↔ (∀ n. alp(af.take(n))); ⊦ ⌜nf⌝ ⊑ ⌜nf0⌝ ↔ nf = nf0; (s)

Proof step 28 from proof cont-rel-thm (previous step) (back to tree)

lim(⌜λ n. f(⌜alf(n)⌝ )⌝ ) ≠ f(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), lift(alp)(lim(⌜λ n. ⌜alf(n)⌝ ⌝ )), mon(⌜λ n. ⌜alf(n)⌝ ⌝ ), ppbd(lift(alp))(f), ¬ alp(af0.take(n)), ∀ n. alp(af0.take(n)), ∀ al1, al2. alp(al2) ∧ al1 ⊑ al2 → alp(al1), ∀ α1, α2. lift(alp)(α1) ∧ lift(alp)(α2) ∧ α1 ⊑ α2 → f(α1) ⊑ f(α2), ∀ n. alp(alf(n)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: n

Additional information

Used terms: n

Proof Tree for cont-rel-thm (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree