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

Theorem fnexALT 7963
Description: Alternate proof of fnex 7223, derived using the Axiom of Replacement in the form of funimaexg 6626. This version uses ax-pow 5327 and ax-un 7751, whereas fnex 7223 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 6641 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6271 . . . 4 (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 18 . . 3 (𝐹 Fn 𝐴 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 486 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6642 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2846 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
76biimpar 483 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵)
8 fnfun 6639 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6626 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
108, 9sylan 592 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
11 imadmrn 6067 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6052 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹 “ 𝐴))
1311, 12eqtr3id 2810 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴))
1413eleq1d 2846 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹 “ 𝐴) ∈ V))
1514biimpar 483 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹 “ 𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 603 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → ran 𝐹 ∈ V)
17 xpexg 7764 . . 3 ((dom 𝐹 ∈ 𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 596 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5281 . 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 2145  Vcvv 3451   ⊆ wss 3899   × cxp 5649  dom cdm 5651  ran crn 5652   “ cima 5654  Rel wrel 5656  Fun wfun 6532   Fn wfn 6533
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6540  df-fn 6541
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator