Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fnunirn | Structured version Visualization version GIF version |
Description: Membership in a union of some function-defined family of sets. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
Ref | Expression |
---|---|
fnunirn | ⊢ (𝐹 Fn 𝐼 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝐼 𝐴 ∈ (𝐹‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnfun 6455 | . . 3 ⊢ (𝐹 Fn 𝐼 → Fun 𝐹) | |
2 | elunirn 7012 | . . 3 ⊢ (Fun 𝐹 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥))) | |
3 | 1, 2 | syl 17 | . 2 ⊢ (𝐹 Fn 𝐼 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥))) |
4 | fndm 6457 | . . 3 ⊢ (𝐹 Fn 𝐼 → dom 𝐹 = 𝐼) | |
5 | 4 | rexeqdv 3418 | . 2 ⊢ (𝐹 Fn 𝐼 → (∃𝑥 ∈ dom 𝐹 𝐴 ∈ (𝐹‘𝑥) ↔ ∃𝑥 ∈ 𝐼 𝐴 ∈ (𝐹‘𝑥))) |
6 | 3, 5 | bitrd 281 | 1 ⊢ (𝐹 Fn 𝐼 → (𝐴 ∈ ∪ ran 𝐹 ↔ ∃𝑥 ∈ 𝐼 𝐴 ∈ (𝐹‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2114 ∃wrex 3141 ∪ cuni 4840 dom cdm 5557 ran crn 5558 Fun wfun 6351 Fn wfn 6352 ‘cfv 6357 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
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 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-iota 6316 df-fun 6359 df-fn 6360 df-fv 6365 |
This theorem is referenced by: itunitc 9845 wunex2 10162 mreunirn 16874 arwhoma 17307 filunirn 22492 xmetunirn 22949 abfmpunirn 30399 cmpcref 31116 neibastop2lem 33710 stoweidlem59 42351 |
Copyright terms: Public domain | W3C validator |