Metamath Proof Explorer


Theorem fcdmnn0suppg

Description: Version of fcdmnn0supp avoiding ax-rep by assuming F is a set rather than its domain I . (Contributed by SN, 5-Aug-2024)

Ref Expression
Assertion fcdmnn0suppg ⊢ F ∈ V ∧ F : I ⟶ ℕ 0 → F supp 0 = F -1 ℕ

Proof

Step Hyp Ref Expression
1 c0ex ⊢ 0 ∈ V
2 fsuppeqg ⊢ F ∈ V ∧ 0 ∈ V → F : I ⟶ ℕ 0 → F supp 0 = F -1 ℕ 0 ∖ 0
3 1 2 mpan2 ⊢ F ∈ V → F : I ⟶ ℕ 0 → F supp 0 = F -1 ℕ 0 ∖ 0
4 3 imp ⊢ F ∈ V ∧ F : I ⟶ ℕ 0 → F supp 0 = F -1 ℕ 0 ∖ 0
5 dfn2 ⊢ ℕ = ℕ 0 ∖ 0
6 5 imaeq2i ⊢ F -1 ℕ = F -1 ℕ 0 ∖ 0
7 4 6 eqtr4di ⊢ F ∈ V ∧ F : I ⟶ ℕ 0 → F supp 0 = F -1 ℕ