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

Theorem fnexALT 7970
Description: Alternate proof of fnex 7230, derived using the Axiom of Replacement in the form of funimaexg 6634. This version uses ax-pow 5330 and ax-un 7758, whereas fnex 7230 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 6649 . . . 4 (𝐹 Fn 𝐴 → Rel 𝐹)
2 relssdmrn 6277 . . . 4 (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
31, 2syl 18 . . 3 (𝐹 Fn 𝐴 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
43adantr 486 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹))
5 fndm 6650 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
65eleq1d 2848 . . . 4 (𝐹 Fn 𝐴 → (dom 𝐹 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
76biimpar 483 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵)
8 fnfun 6647 . . . . 5 (𝐹 Fn 𝐴 → Fun 𝐹)
9 funimaexg 6634 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
108, 9sylan 592 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V)
11 imadmrn 6072 . . . . . . 7 (𝐹 “ dom 𝐹) = ran 𝐹
125imaeq2d 6057 . . . . . . 7 (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹 “ 𝐴))
1311, 12eqtr3id 2812 . . . . . 6 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴))
1413eleq1d 2848 . . . . 5 (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹 “ 𝐴) ∈ V))
1514biimpar 483 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐹 “ 𝐴) ∈ V) → ran 𝐹 ∈ V)
1610, 15syldan 603 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → ran 𝐹 ∈ V)
17 xpexg 7771 . . 3 ((dom 𝐹 ∈ 𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V)
187, 16, 17syl2anc 596 . 2 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (dom 𝐹 × ran 𝐹) ∈ V)
19 ssexg 5284 . 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 2146  Vcvv 3453   ⊆ wss 3899   × cxp 5652  dom cdm 5654  ran crn 5655   “ cima 5657  Rel wrel 5659  Fun wfun 6540   Fn wfn 6541
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-fun 6548  df-fn 6549
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator