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

Theorem fnexALT 7893
Description: Alternate proof of fnex 7161, derived using the Axiom of Replacement in the form of funimaexg 6572. This version uses ax-pow 5294 and ax-un 7678, whereas fnex 7161 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 6587 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6220 . . . 4 (Rel 𝐹𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 17 . . 3 (𝐹 Fn 𝐴𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 481 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6588 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2824 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹𝐵𝐴𝐵))
76biimpar 478 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → dom 𝐹𝐵)
8 fnfun 6585 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6572 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
108, 9sylan 586 . . . 4 ((𝐹 Fn 𝐴𝐴𝐵) → (𝐹𝐴) ∈ V)
11 imadmrn 6022 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6012 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹𝐴))
1311, 12eqtr3id 2788 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹𝐴))
1413eleq1d 2824 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹𝐴) ∈ V))
1514biimpar 478 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 597 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → ran 𝐹 ∈ V)
17 xpexg 7693 . . 3 ((dom 𝐹𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 590 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5251 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 590 1 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wcel 2119  Vcvv 3431  wss 3883   × cxp 5616  dom cdm 5618  ran crn 5619  cima 5621  Rel wrel 5623  Fun wfun 6479   Fn wfn 6480
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-mo 2543  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-fun 6487  df-fn 6488
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator