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

Theorem fnexALT 7932
Description: Alternate proof of fnex 7201, derived using the Axiom of Replacement in the form of funimaexg 6608. This version uses ax-pow 5322 and ax-un 7718, whereas fnex 7201 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 6623 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6256 . . . 4 (Rel 𝐹𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 17 . . 3 (𝐹 Fn 𝐴𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 484 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6624 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2847 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹𝐵𝐴𝐵))
76biimpar 481 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → dom 𝐹𝐵)
8 fnfun 6621 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6608 . . . . 5 ((Fun 𝐹𝐴𝐵) → (𝐹𝐴) ∈ V)
108, 9sylan 589 . . . 4 ((𝐹 Fn 𝐴𝐴𝐵) → (𝐹𝐴) ∈ V)
11 imadmrn 6059 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6049 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹𝐴))
1311, 12eqtr3id 2811 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹𝐴))
1413eleq1d 2847 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹𝐴) ∈ V))
1514biimpar 481 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 600 . . 3 ((𝐹 Fn 𝐴𝐴𝐵) → ran 𝐹 ∈ V)
17 xpexg 7733 . . 3 ((dom 𝐹𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 593 . 2 ((𝐹 Fn 𝐴𝐴𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5279 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 593 1 ((𝐹 Fn 𝐴𝐴𝐵) → 𝐹 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wcel 2142  Vcvv 3454  wss 3904   × cxp 5645  dom cdm 5647  ran crn 5648  cima 5650  Rel wrel 5652  Fun wfun 6515   Fn wfn 6516
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-mo 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-fun 6523  df-fn 6524
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator