| 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 7254. It is shorter but requires ax-pow 5347 (through eluniima 7253, funiunfv 7251, ndmfv 6922). (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 6070 | . . . 4 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹 | |
| 2 | 1 | unieqi 4901 | . . 3 ⊢ ∪ (𝐹 “ dom 𝐹) = ∪ ran 𝐹 |
| 3 | 2 | eleq2i 2825 | . 2 ⊢ (𝐴 ∈ ∪ (𝐹 “ dom 𝐹) ↔ 𝐴 ∈ ∪ ran 𝐹) |
| 4 | eluniima 7253 | . 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 2107 ∃wrex 3059 ∪ cuni 4889 dom cdm 5667 ran crn 5668 “ cima 5670 Fun wfun 6536 ‘cfv 6542 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5278 ax-nul 5288 ax-pr 5414 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3421 df-v 3466 df-dif 3936 df-un 3938 df-in 3940 df-ss 3950 df-nul 4316 df-if 4508 df-sn 4609 df-pr 4611 df-op 4615 df-uni 4890 df-iun 4975 df-br 5126 df-opab 5188 df-mpt 5208 df-id 5560 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6495 df-fun 6544 df-fn 6545 df-fv 6550 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |