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

Theorem fnexALT 7944
Description: Alternate proof of fnex 7215, derived using the Axiom of Replacement in the form of funimaexg 6622. This version uses ax-pow 5336 and ax-un 7732, whereas fnex 7215 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 6637 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6270 . . . 4 (Rel 𝐹𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 18 . . 3 (𝐹 Fn 𝐴𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 485 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6638 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2848 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹𝐵𝐴𝐵))
76biimpar 482 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → dom 𝐹𝐵)
8 fnfun 6635 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6622 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
108, 9sylan 591 . . . 4 ((𝐹 Fn 𝐴𝐴𝐵) → (𝐹𝐴) ∈ V)
11 imadmrn 6072 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6062 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹𝐴))
1311, 12eqtr3id 2812 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹𝐴))
1413eleq1d 2848 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹𝐴) ∈ V))
1514biimpar 482 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 602 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → ran 𝐹 ∈ V)
17 xpexg 7745 . . 3 ((dom 𝐹𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 595 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5290 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 595 1 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wcel 2143  Vcvv 3455  wss 3905   × cxp 5659  dom cdm 5661  ran crn 5662  cima 5664  Rel wrel 5666  Fun wfun 6530   Fn wfn 6531
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-fun 6538  df-fn 6539
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator