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

Theorem fnexALT 7997
Description: Alternate proof of fnex 7254, derived using the Axiom of Replacement in the form of funimaexg 6656. This version uses ax-pow 5334 and ax-un 7783, whereas fnex 7254 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 6671 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6295 . . . 4 (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 18 . . 3 (𝐹 Fn 𝐴 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 486 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6672 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2849 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
76biimpar 483 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵)
8 fnfun 6669 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6656 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
108, 9sylan 592 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
11 imadmrn 6085 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6070 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹 “ 𝐴))
1311, 12eqtr3id 2812 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴))
1413eleq1d 2849 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹 “ 𝐴) ∈ V))
1514biimpar 483 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹 “ 𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 603 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → ran 𝐹 ∈ V)
17 xpexg 7796 . . 3 ((dom 𝐹 ∈ 𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 596 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5288 . 2 ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V)
204, 18, 19syl2anc 596 1 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   × cxp 5656  dom cdm 5658  ran crn 5659   “ cima 5661  Rel wrel 5663  Fun wfun 6560   Fn wfn 6561
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-fun 6568  df-fn 6569
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator