Theorem: LO.FirstOrder.Arith.Model.domain_restr (Arithmetization/ISigmaOne/HFS/Basic.lean)

State before:
M : Type u_1
inst✝⁵ : Zero M
inst✝⁴ : One M
inst✝³ : Add M
inst✝² : Mul M
inst✝¹ : LT M
inst✝ : M ⊧ₘ* 𝐈𝚺₁
f s : M
⊢ ∀ (i : M), i ∈ domain (f ↾ s) ↔ i ∈ domain f ∩ s
Tactic:
simp [mem_domain_iff, pair_mem_restr_iff, exists_and_right, mem_inter_iff]
State after:
no goals