Theorems · Theorem · number theory
Set.iUnion_unpair_prod
∀ {α : Type u_1} {β : Type u_2} {s : ℕ → Set α} {t : ℕ → Set β},
⋃ n, s (Nat.unpair n).1 ×ˢ t (Nat.unpair n).2 = (⋃ n, s n) ×ˢ ⋃ n, t n- Defined in
- Mathlib.Data.Nat.Pairing
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.iUnionstatement and proof · cited by 2,483
- SProd.sprodstatement and proof · cited by 1,750
- Nat.unpairstatement and proof · cited by 67
- Function.Surjective.iUnion_compproof · cited by 10
- Nat.surjective_unpairproof · cited by 3
- Set.iUnion_prodproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- IsCountablySpanning.prodproof · cited by 1