| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elunirnALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of elunirn 7225. It is shorter but requires ax-pow 5320 (through eluniima 7224, funiunfv 7222, ndmfv 6893). (Contributed by NM, 24-Sep-2006.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| elunirnALT | ⊢ (Fun 𝐹 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imadmrn 6041 | . . . 4 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹 | |
| 2 | 1 | unieqi 4883 | . . 3 ⊢ ∪ (𝐹 “ dom 𝐹) = ∪ ran 𝐹 |
| 3 | 2 | eleq2i 2820 | . 2 ⊢ (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ 𝐴 ∈ ∪ ran 𝐹) |
| 4 | eluniima 7224 | . 2 ⊢ (Fun 𝐹 → (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥))) | |
| 5 | 3, 4 | bitr3id 285 | 1 ⊢ (Fun 𝐹 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2109 ∃wrex 3053 ∪ cuni 4871 dom cdm 5638 ran crn 5639 “ cima 5641 Fun wfun 6505 ‘cfv 6511 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-fv 6519 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |