| 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 7195. It is shorter but requires ax-pow 5296 (through eluniima 7194, funiunfv 7192, ndmfv 6861). (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 6024 | . . . 4 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹 | |
| 2 | 1 | unieqi 4852 | . . 3 ⊢ ∪ (𝐹 “ dom 𝐹) = ∪ ran 𝐹 |
| 3 | 2 | eleq2i 2827 | . 2 ⊢ (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ 𝐴 ∈ ∪ ran 𝐹) |
| 4 | eluniima 7194 | . 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 2114 ∃wrex 3059 ∪ cuni 4840 dom cdm 5620 ran crn 5621 “ cima 5623 Fun wfun 6481 ‘cfv 6487 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pr 5364 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-rab 3388 df-v 3429 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6443 df-fun 6489 df-fn 6490 df-fv 6495 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |