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

Theorem elunirnALT 7279
Description: Alternate proof of elunirn 7278. It is shorter but requires ax-pow 5331 (through eluniima 7277, funiunfv 7275, ndmfv 6940). (Contributed by NM, 24-Sep-2006.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
elunirnALT (Fun 𝐹 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem elunirnALT
StepHypRef Expression
1 imadmrn 6079 . . . 4 (𝐹 “ dom 𝐹) = ran 𝐹
21unieqi 4882 . . 3 ∪ (𝐹 “ dom 𝐹) = ∪ ran 𝐹
32eleq2i 2856 . 2 (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ 𝐴 ∈ ∪ ran 𝐹)
4 eluniima 7277 . 2 (Fun 𝐹 → (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥)))
53, 4bitr3id 288 1 (Fun 𝐹 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∈ wcel 2147  ∃wrex 3090  ∪ cuni 4870  dom cdm 5655  ran crn 5656   “ cima 5658  Fun wfun 6552  ‘cfv 6558
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  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-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-fv 6566
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator