ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fnexALT GIF version

Theorem fnexALT 6011
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 5207. This version of fnex 5642 uses ax-pow 4098 and ax-un 4355, whereas fnex 5642 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
StepHypRef Expression
1 fnrel 5221 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 5059 . . . 4 (Rel 𝐹𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 14 . . 3 (𝐹 Fn 𝐴𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 274 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 5222 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2208 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹𝐵𝐴𝐵))
76biimpar 295 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → dom 𝐹𝐵)
8 fnfun 5220 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 5207 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
108, 9sylan 281 . . . 4 ((𝐹 Fn 𝐴𝐴𝐵) → (𝐹𝐴) ∈ V)
11 imadmrn 4891 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 4881 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹𝐴))
1311, 12syl5eqr 2186 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹𝐴))
1413eleq1d 2208 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹𝐴) ∈ V))
1514biimpar 295 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 280 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → ran 𝐹 ∈ V)
17 xpexg 4653 . . 3 ((dom 𝐹𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 408 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 4067 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 408 1 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ∈ V)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wcel 1480  Vcvv 2686  wss 3071   × cxp 4537  dom cdm 4539  ran crn 4540  cima 4542  Rel wrel 4544  Fun wfun 5117   Fn wfn 5118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-fun 5125  df-fn 5126
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator