exact { val := a_set_of_nxn, property := by simp }
f : ↑(𝒫 Set.univ) → ↑(𝒫 Set.univ) :=
  fun a_set_of_nxn =>
    { val := {x | ∃ x_1 ∈ ↑a_set_of_nxn, 2 ^ x_1.1 * 3 ^ x_1.2 = x},
      property := (_ : {x | ∃ x_1 ∈ ↑a_set_of_nxn, 2 ^ x_1.1 * 3 ^ x_1.2 = x} ∈ 𝒫 Set.univ) }
hf : Function.Injective f
a_set_of_n : ↑(𝒫 Set.univ)
a_set_of_nxn : Set (ℕ × ℕ)
⊢ ↑(𝒫 Set.univ)
no goals