Theorem: Function.Graph₂.iff_left (Arithmetization/Vorspiel/Graph.lean)

State before:
σ : Sort u_1
α : Sort u_2
β : Sort u_3
f : α → β → σ
y : σ
x₁ : α
x₂ : β
⊢ f x₁ x₂ = y ↔ Graph₂ f y x₁ x₂
Tactic:
simp [Graph₂, eq_comm]
State after:
no goals