logo
In [1]:
import proveit
from proveit import A, B
from proveit.logic.sets.inclusion  import subset_eq_def
%proving unfold_subset_eq
Under these presumptions, we begin our proof of
unfold_subset_eq:
(see dependencies)
unfold_subset_eq may now be readily provable (assuming required theorems are usable).  Simply execute "%qed".
In [2]:
subset_eq_def
In [3]:
SubsetEqDef_inst = subset_eq_def.instantiate()
SubsetEqDef_inst:  ⊢  
In [4]:
SubsetEqDef_inst.derive_right_via_equality(assumptions=[SubsetEqDef_inst.lhs])
In [5]:
%qed
proveit.logic.sets.inclusion.unfold_subset_eq has been proven.
Out[5]:
 step typerequirementsstatement
0generalization1  ⊢  
1instantiation2, 3, 4  ⊢  
  : , :
2theorem  ⊢  
 proveit.logic.equality.rhs_via_equality
3assumption  ⊢  
4instantiation5  ⊢  
  : , :
5axiom  ⊢  
 proveit.logic.sets.inclusion.subset_eq_def