![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfcoll2 | Structured version Visualization version GIF version |
Description: Alternate definition of the collection operation. (Contributed by Rohan Ridenour, 11-Aug-2023.) |
Ref | Expression |
---|---|
dfcoll2 | ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott {𝑦 ∣ 𝑥𝐹𝑦} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-coll 40959 | . 2 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥}) | |
2 | imasng 5918 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝐹 “ {𝑥}) = {𝑦 ∣ 𝑥𝐹𝑦}) | |
3 | 2 | scotteqd 40945 | . . 3 ⊢ (𝑥 ∈ 𝐴 → Scott (𝐹 “ {𝑥}) = Scott {𝑦 ∣ 𝑥𝐹𝑦}) |
4 | 3 | iuneq2i 4902 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥}) = ∪ 𝑥 ∈ 𝐴 Scott {𝑦 ∣ 𝑥𝐹𝑦} |
5 | 1, 4 | eqtri 2821 | 1 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott {𝑦 ∣ 𝑥𝐹𝑦} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 {cab 2776 {csn 4525 ∪ ciun 4881 class class class wbr 5030 “ cima 5522 Scott cscott 40943 Coll ccoll 40958 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-iun 4883 df-br 5031 df-opab 5093 df-xp 5525 df-cnv 5527 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-scott 40944 df-coll 40959 |
This theorem is referenced by: cpcolld 40966 grucollcld 40968 |
Copyright terms: Public domain | W3C validator |