Theorem fnmptif 46550

Description: Functionality and domain of an ordered-pair class abstraction. (Contributed by Glauco Siliprandi, 21-Dec-2024.)

Hypotheses

Ref	Expression
fnmptif.1	⊢ Ⅎ𝑥𝐴
fnmptif.2	⊢ 𝐵 ∈ V
fnmptif.3	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)

Assertion

Ref	Expression
fnmptif	⊢ 𝐹 Fn 𝐴

Proof of Theorem fnmptif

Step	Hyp	Ref	Expression
1		fnmptif.2	. . . 4 ⊢ 𝐵 ∈ V
2	1	rgenw 3084	. . 3 ⊢ ∀𝑥 ∈ 𝐴 𝐵 ∈ V
3		fnmptif.1	. . . 4 ⊢ Ⅎ𝑥𝐴
4	3	mptfnf 6704	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
5	2, 4	mpbi 233	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴
6		fnmptif.3	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
7	6	fneq1i 6666	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
8	5, 7	mpbir 234	1 ⊢ 𝐹 Fn 𝐴

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080  Vcvv 3454   ↦ cmpt 5192   Fn wfn 6561

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-fun 6568  df-fn 6569

This theorem is used by:  dmmptif  46551