Since it is still under development, I am not sure if every path is properly defined, but here is what I found.
In the level 2 / 8 of [WIP] Mengenlehre 2 we are introduced to theorems involving Powerset and subset_union. Even so, we are not allowed to close a goal with Set.subset_union_of_subset_left, when we cannot use commutativity of the union:
Is this the intention? My proof so far:
example (X Y : Set ℕ): 𝒫 X ∪ 𝒫 Y ⊆ 𝒫 (X ∪ Y) := by
intro S
intro sInPxPy
rw [Set.mem_powerset_iff]
rw [Set.mem_union] at sInPxPy
rcases sInPxPy with spx | spy
rw [Set.mem_powerset_iff] at spx
apply Set.subset_union_of_subset_left spx Y
rw [Set.mem_powerset_iff] at spy
have h : S ⊆ Y ∪ X
apply Set.subset_union_of_subset_left spy X
In the level 2 / 8 of
[WIP] Mengenlehre 2
we are introduced to theorems involvingPowerset
andsubset_union
. Even so, we are not allowed to close a goal withSet.subset_union_of_subset_left
, when we cannot use commutativity of the union:Is this the intention? My proof so far:
Shouldn't
Set.union_comm
be available?