Theorem: Function.Bijective.Prod.mk.arg_fstsnd.Bijective_rule_simple (SciLean/Core/FunctionPropositions/Bijective.lean)

State before:
X✝ : Type ?u.362
inst✝⁷ : Nonempty X✝
Y✝ : Type ?u.368
inst✝⁶ : Nonempty Y✝
Z✝ : Type ?u.374
inst✝⁵ : Nonempty Z✝
X : Type u_1
inst✝⁴ : Nonempty X
X₁ : Type ?u.386
inst✝³ : Nonempty X₁
X₂ : Type ?u.392
inst✝² : Nonempty X₂
Y : Type u_2
inst✝¹ : Nonempty Y
Z : Type ?u.404
inst✝ : Nonempty Z
⊢ Bijective fun xy => (xy.1, xy.2)
Tactic:
sorry_proof
State after:
no goals