[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 2 from proof vols-is-max-is-min-eraseq (previous step)

is-max(apebs, vols0, wlar0, q0, bflipset0, n0, n1), ubi-cons(apebs, vols1, wlar1, q1, bflipset, m0, m1) ⊦ q0.lebrefs ⊆ q1.lebrefs

User applied rule apply lemma

And obtained the following new goals

Proof step 3:
⊦ is-max(apebs, vols0, wlar0, q0, bflipset0, n0, n1) ∧ ubi-cons(apebs, vols1, wlar1, q1, bflipset1, m0, m1) → vols1 ⊆ vols0
Proof step 4:
is-max(apebs, vols0, wlar0, q0, bflipset0, n0, n1), ubi-cons(apebs, vols1, wlar1, q1, bflipset, m0, m1), is-max(apebs, vols0, wlar0, q0, bflipset0, n0, n1) ∧ ubi-cons(apebs, vols1, wlar1, q1, bflipset, m0, m1) → vols1 ⊆ vols0 ⊦ q0.lebrefs ⊆ q1.lebrefs

Rule argument

spec: <toplevel> name: vols-is-max-is-max-vols seq: ⊦ is-max(apebs, vols0, wlar0, q0, bflipset0, n0, n1) ∧ ubi-cons(apebs, vols1, wlar1, q1, bflipset1, m0, m1) → vols1 ⊆ vols0 subst: [apebs, vols0, wlar0, q0, bflipset0, n0, n1, vols1, wlar1, q1, bflipset1, m0, m1] → [apebs, vols0, wlar0, q0, bflipset0, n0, n1, vols1, wlar1, q1, bflipset, m0, m1]

Additional information

Used terms: apebs, vols0, wlar0, q0, bflipset0, n0, n1, vols1, wlar1, q1, bflipset, m0, m1