Theorems · Theorem · order theory
Finset.union_eq_right
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α}, s ∪ t = t ↔ s ⊆ t- Defined in
- Mathlib.Data.Finset.Lattice.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- sup_eq_rightproof · cited by 53
Cited by5
Results whose statement or proof uses this declaration.
- Finset.card_dvd_card_image₂_rightproof · cited by 6
- SummationFilter.comap_unconditionalproof · cited by 4
- Turing.PartrecToTM2.codeSupp_compproof · cited by 2
- Finset.mem_shadow_iterate_iff_exists_sdiffproof · cited by 2
- Finset.right_eq_unionproof · cited by 0