[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 90 from proof map-path (previous step)

closed(H), inj(map), reachset(r0, H) ⊆ dom map ⊦ path(x, r0, r1, H) ↔ path(x, map[r0], map[r1], apply(H, map)) ∧ r0 ∈ map ∧ r1 ∈ map

User applied rule case distinction

And obtained the following new goals

Proof step 49:
path(x, r0, r1, H), closed(H), inj(map), reachset(r0, H) ⊆ dom map ⊦ path(x, map[r0], map[r1], apply(H, map)) ∧ r0 ∈ map ∧ r1 ∈ map

Rule argument

pos:right 1

Additional information

[Concretesimprules(())]