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

Theorem elunirnALT 6992
Description: Alternate proof of elunirn 6991. It is shorter but requires ax-pow 5247 (through eluniima 6990, funiunfv 6988, ndmfv 6681). (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 5920 . . . 4 (𝐹 “ dom 𝐹) = ran 𝐹
21unieqi 4832 . . 3 (𝐹 “ dom 𝐹) = ran 𝐹
32eleq2i 2902 . 2 (𝐴 (𝐹 “ dom 𝐹) ↔ 𝐴 ran 𝐹)
4 eluniima 6990 . 2 (Fun 𝐹 → (𝐴 (𝐹 “ dom 𝐹) ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹𝑥)))
53, 4syl5bbr 287 1 (Fun 𝐹 → (𝐴 ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wcel 2114  wrex 3134   cuni 4819  dom cdm 5536  ran crn 5537  cima 5539  Fun wfun 6330  cfv 6336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5184  ax-nul 5191  ax-pow 5247  ax-pr 5311
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ral 3138  df-rex 3139  df-rab 3142  df-v 3483  df-sbc 3759  df-dif 3922  df-un 3924  df-in 3926  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-iun 4902  df-br 5048  df-opab 5110  df-mpt 5128  df-id 5441  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6295  df-fun 6338  df-fn 6339  df-fv 6344
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator