Theorem fnexALT 6340

Description: If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of funimaexg 5465. This version of fnex 5937 uses ax-pow 4311 and ax-un 4578, whereas fnex 5937 does not. (Contributed by NM, 14-Aug-1994.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
fnexALT	⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V)

Proof of Theorem fnexALT

Step	Hyp	Ref	Expression
1		fnrel 5479	. . . 4 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹)
2		relssdmrn 5308	. . . 4 ⊢ (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
3	1, 2	syl 14	. . 3 ⊢ (𝐹 Fn 𝐴 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
4	3	adantr 276	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5		fndm 5480	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
6	5	eleq1d 2307	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
7	6	biimpar 297	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵)
8		fnfun 5478	. . . . 5 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
9		funimaexg 5465	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
10	8, 9	sylan 283	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
11		imadmrn 5136	. . . . . . 7 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹
12	5	imaeq2d 5126	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹 “ 𝐴))
13	11, 12	eqtr3id 2285	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴))
14	13	eleq1d 2307	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹 “ 𝐴) ∈ V))
15	14	biimpar 297	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐹 “ 𝐴) ∈ V) → ran 𝐹 ∈ V)
16	10, 15	syldan 282	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → ran 𝐹 ∈ V)
17		xpexg 4889	. . 3 ⊢ ((dom 𝐹 ∈ 𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
18	7, 16, 17	syl2anc 415	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19		ssexg 4272	. 2 ⊢ ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
20	4, 18, 19	syl2anc 415	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∈ wcel 2209  Vcvv 2821   ⊆ wss 3220   × cxp 4772  dom cdm 4774  ran crn 4775   “ cima 4777  Rel wrel 4779  Fun wfun 5371   Fn wfn 5372

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-fun 5379  df-fn 5380

This theorem is used by: (None)