[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 59 from proof contains-subspec (previous step)

tys + ty0 ' = ty3 ' + tys1, has_classtype(ty), same-subclasses-contains(ty .jtelemtype .class, str, str0), level⊆(str0, str), type∃(str, ty), contains(str0, ty3 ' + tys1), type∃(str0, ty1), ty1 ≤ ty, is_reftype(ty), type∃(str0, ty), is_classtype(ty1) → ¬ interface∃(str0, ty1 .class) ∧ mkfs(class, ty2, fieldvar) ' ∈ instfields(ty1 .class) ∧ ty3 ≤ ty2, is_arraytype(ty1) → ty3 ≤ ty1 .type, ∀ ty0, str0, str, ty, tys0. # tys0 < # tys → ( has_classtype(ty) ∧ same-subclasses-contains(ty .jtelemtype .class, str, str0) ∧ level⊆(str0, str) ∧ type∃(str, ty) ∧ contains(str0, ty ' + tys0 + ty0 ') → contains(str, ty, ty0) ∨ dups(tys0) ∨ ty ∈ tys0) ⊦ contains(str, ty, ty0), dups(tys), ty ∈ tys, ty0 ≠ ty3 ∧ ¬ ty0 ∈ tys1, ¬ ty3 ∈ tys ∧ ty3 ≠ ty0

User applied rule cut formula

And obtained the following new goals

Proof step 18:
tys1 = [], tys + ty0 ' = ty3 ' + tys1, has_classtype(ty), same-subclasses-contains(ty .jtelemtype .class, str, str0), level⊆(str0, str), type∃(str, ty), contains(str0, ty3 ' + tys1), type∃(str0, ty1), ty1 ≤ ty, is_reftype(ty), type∃(str0, ty), is_classtype(ty1) → ¬ interface∃(str0, ty1 .class) ∧ mkfs(class, ty2, fieldvar) ' ∈ instfields(ty1 .class) ∧ ty3 ≤ ty2, is_arraytype(ty1) → ty3 ≤ ty1 .type, ∀ ty0, str0, str, ty, tys0. # tys0 < # tys → ( has_classtype(ty) ∧ same-subclasses-contains(ty .jtelemtype .class, str, str0) ∧ level⊆(str0, str) ∧ type∃(str, ty) ∧ contains(str0, ty ' + tys0 + ty0 ') → contains(str, ty, ty0) ∨ dups(tys0) ∨ ty ∈ tys0) ⊦ contains(str, ty, ty0), dups(tys), ty ∈ tys, ty0 ≠ ty3 ∧ ¬ ty0 ∈ tys1, ¬ ty3 ∈ tys ∧ ty3 ≠ ty0
Proof step 58:
tys + ty0 ' = ty3 ' + tys1, has_classtype(ty), same-subclasses-contains(ty .jtelemtype .class, str, str0), level⊆(str0, str), type∃(str, ty), contains(str0, ty3 ' + tys1), type∃(str0, ty1), ty1 ≤ ty, is_reftype(ty), type∃(str0, ty), is_classtype(ty1) → ¬ interface∃(str0, ty1 .class) ∧ mkfs(class, ty2, fieldvar) ' ∈ instfields(ty1 .class) ∧ ty3 ≤ ty2, is_arraytype(ty1) → ty3 ≤ ty1 .type, ∀ ty0, str0, str, ty, tys0. # tys0 < # tys → ( has_classtype(ty) ∧ same-subclasses-contains(ty .jtelemtype .class, str, str0) ∧ level⊆(str0, str) ∧ type∃(str, ty) ∧ contains(str0, ty ' + tys0 + ty0 ') → contains(str, ty, ty0) ∨ dups(tys0) ∨ ty ∈ tys0) ⊦ tys1 = [], contains(str, ty, ty0), dups(tys), ty ∈ tys, ty0 ≠ ty3 ∧ ¬ ty0 ∈ tys1, ¬ ty3 ∈ tys ∧ ty3 ≠ ty0

Rule argument

[fma-arg: tys1 = []]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRAFMAS : (tys1 = [])]]