Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mreunirn | Structured version Visualization version GIF version |
Description: Two ways to express the notion of being a Moore collection on an unspecified base. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
Ref | Expression |
---|---|
mreunirn | ⊢ (𝐶 ∈ ∪ ran Moore ↔ 𝐶 ∈ (Moore‘∪ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnmre 17398 | . . . 4 ⊢ Moore Fn V | |
2 | fnunirn 7188 | . . . 4 ⊢ (Moore Fn V → (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥))) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥)) |
4 | mreuni 17407 | . . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑥) → ∪ 𝐶 = 𝑥) | |
5 | 4 | fveq2d 6834 | . . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑥) → (Moore‘∪ 𝐶) = (Moore‘𝑥)) |
6 | 5 | eleq2d 2823 | . . . . 5 ⊢ (𝐶 ∈ (Moore‘𝑥) → (𝐶 ∈ (Moore‘∪ 𝐶) ↔ 𝐶 ∈ (Moore‘𝑥))) |
7 | 6 | ibir 268 | . . . 4 ⊢ (𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶)) |
8 | 7 | rexlimivw 3145 | . . 3 ⊢ (∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶)) |
9 | 3, 8 | sylbi 216 | . 2 ⊢ (𝐶 ∈ ∪ ran Moore → 𝐶 ∈ (Moore‘∪ 𝐶)) |
10 | fvssunirn 6863 | . . 3 ⊢ (Moore‘∪ 𝐶) ⊆ ∪ ran Moore | |
11 | 10 | sseli 3932 | . 2 ⊢ (𝐶 ∈ (Moore‘∪ 𝐶) → 𝐶 ∈ ∪ ran Moore) |
12 | 9, 11 | impbii 208 | 1 ⊢ (𝐶 ∈ ∪ ran Moore ↔ 𝐶 ∈ (Moore‘∪ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∈ wcel 2106 ∃wrex 3071 Vcvv 3442 ∪ cuni 4857 ran crn 5626 Fn wfn 6479 ‘cfv 6484 Moorecmre 17389 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5248 ax-nul 5255 ax-pow 5313 ax-pr 5377 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3405 df-v 3444 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4275 df-if 4479 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4858 df-br 5098 df-opab 5160 df-mpt 5181 df-id 5523 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-iota 6436 df-fun 6486 df-fn 6487 df-fv 6492 df-mre 17393 |
This theorem is referenced by: fnmrc 17414 mrcfval 17415 |
Copyright terms: Public domain | W3C validator |