Theorem fnmptif 46095

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 3080	. . 3 ⊢ ∀𝑥 ∈ 𝐴 𝐵 ∈ V
3		fnmptif.1	. . . 4 ⊢ Ⅎ𝑥𝐴
4	3	mptfnf 6668	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
5	2, 4	mpbi 233	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴
6		fnmptif.3	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
7	6	fneq1i 6630	. 2 ⊢ (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
8	5, 7	mpbir 234	1 ⊢ 𝐹 Fn 𝐴

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2907  ∀wral 3076  Vcvv 3450   ↦ cmpt 5186   Fn wfn 6528

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-fun 6535  df-fn 6536

This theorem is used by:  dmmptif  46096