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 17300 | . . . 4 ⊢ Moore Fn V | |
2 | fnunirn 7127 | . . . 4 ⊢ (Moore Fn V → (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥))) | |
3 | 1, 2 | ax-mp 5 | . . 3 ⊢ (𝐶 ∈ ∪ ran Moore ↔ ∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥)) |
4 | mreuni 17309 | . . . . . . 7 ⊢ (𝐶 ∈ (Moore‘𝑥) → ∪ 𝐶 = 𝑥) | |
5 | 4 | fveq2d 6778 | . . . . . 6 ⊢ (𝐶 ∈ (Moore‘𝑥) → (Moore‘∪ 𝐶) = (Moore‘𝑥)) |
6 | 5 | eleq2d 2824 | . . . . 5 ⊢ (𝐶 ∈ (Moore‘𝑥) → (𝐶 ∈ (Moore‘∪ 𝐶) ↔ 𝐶 ∈ (Moore‘𝑥))) |
7 | 6 | ibir 267 | . . . 4 ⊢ (𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶)) |
8 | 7 | rexlimivw 3211 | . . 3 ⊢ (∃𝑥 ∈ V 𝐶 ∈ (Moore‘𝑥) → 𝐶 ∈ (Moore‘∪ 𝐶)) |
9 | 3, 8 | sylbi 216 | . 2 ⊢ (𝐶 ∈ ∪ ran Moore → 𝐶 ∈ (Moore‘∪ 𝐶)) |
10 | fvssunirn 6803 | . . 3 ⊢ (Moore‘∪ 𝐶) ⊆ ∪ ran Moore | |
11 | 10 | sseli 3917 | . 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 3065 Vcvv 3432 ∪ cuni 4839 ran crn 5590 Fn wfn 6428 ‘cfv 6433 Moorecmre 17291 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-iota 6391 df-fun 6435 df-fn 6436 df-fv 6441 df-mre 17295 |
This theorem is referenced by: fnmrc 17316 mrcfval 17317 |
Copyright terms: Public domain | W3C validator |