[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 3 from proof subset-uni (
previous step
)
H0 ⊆ H1 ⊦ ∃ H. H ∪ H0 = H1 ∧ H ⊥ H0
User applied rule exists right
And obtained the following new goals
Proof step 4
:
H0 ⊆ H1 ⊦ (H1 \ H0) ∪ H0 = H1 ∧ H1 \ H0 ⊥ H0
Rule argument
pos: right 1 terms: H1 \ H0 abort: F discard: T computed: F
Additional information
Used terms: H1 \ H0