MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnexALT Structured version   Visualization version   GIF version

Theorem fnexALT 7793
Description: Alternate proof of fnex 7093, derived using the Axiom of Replacement in the form of funimaexg 6520. This version uses ax-pow 5288 and ax-un 7588, whereas fnex 7093 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 6535 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6172 . . . 4 (Rel 𝐹𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 17 . . 3 (𝐹 Fn 𝐴𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 481 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6536 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2823 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹𝐵𝐴𝐵))
76biimpar 478 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → dom 𝐹𝐵)
8 fnfun 6533 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6520 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
108, 9sylan 580 . . . 4 ((𝐹 Fn 𝐴𝐴𝐵) → (𝐹𝐴) ∈ V)
11 imadmrn 5979 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 5969 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹𝐴))
1311, 12eqtr3id 2792 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹𝐴))
1413eleq1d 2823 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹𝐴) ∈ V))
1514biimpar 478 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 591 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → ran 𝐹 ∈ V)
17 xpexg 7600 . . 3 ((dom 𝐹𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 584 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5247 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 584 1 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wcel 2106  Vcvv 3432  wss 3887   × cxp 5587  dom cdm 5589  ran crn 5590  cima 5592  Rel wrel 5594  Fun wfun 6427   Fn wfn 6428
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-fun 6435  df-fn 6436
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator