| Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cpcolld | Structured version Visualization version GIF version | ||
| Description: Property of the collection operation. (Contributed by Rohan Ridenour, 11-Aug-2023.) |
| Ref | Expression |
|---|---|
| cpcolld.1 | ⊢ (𝜑 → 𝑥 ∈ 𝐴) |
| cpcolld.2 | ⊢ (𝜑 → 𝑥𝐹𝑦) |
| Ref | Expression |
|---|---|
| cpcolld | ⊢ (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cpcolld.1 | . . 3 ⊢ (𝜑 → 𝑥 ∈ 𝐴) | |
| 2 | cpcolld.2 | . . . . . 6 ⊢ (𝜑 → 𝑥𝐹𝑦) | |
| 3 | vex 3440 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 4 | breq2 5090 | . . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑥𝐹𝑧 ↔ 𝑥𝐹𝑦)) | |
| 5 | 3, 4 | elab 3630 | . . . . . 6 ⊢ (𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧} ↔ 𝑥𝐹𝑦) |
| 6 | 2, 5 | sylibr 234 | . . . . 5 ⊢ (𝜑 → 𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧}) |
| 7 | 6 | 19.8ad 2185 | . . . 4 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧}) |
| 8 | 7 | scotteld 44279 | . . 3 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧}) |
| 9 | ssiun2 4991 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → Scott {𝑧 ∣ 𝑥𝐹𝑧} ⊆ ∪ 𝑥 ∈ 𝐴 Scott {𝑧 ∣ 𝑥𝐹𝑧}) | |
| 10 | dfcoll2 44285 | . . . . . . . 8 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott {𝑧 ∣ 𝑥𝐹𝑧} | |
| 11 | 9, 10 | sseqtrrdi 3971 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → Scott {𝑧 ∣ 𝑥𝐹𝑧} ⊆ (𝐹 Coll 𝐴)) |
| 12 | 11 | sselda 3929 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧}) → 𝑦 ∈ (𝐹 Coll 𝐴)) |
| 13 | 4 | elscottab 44277 | . . . . . . 7 ⊢ (𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧} → 𝑥𝐹𝑦) |
| 14 | 13 | adantl 481 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧}) → 𝑥𝐹𝑦) |
| 15 | 12, 14 | jca 511 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧}) → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)) |
| 16 | 15 | ex 412 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧} → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))) |
| 17 | 16 | eximdv 1918 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧} → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))) |
| 18 | 1, 8, 17 | sylc 65 | . 2 ⊢ (𝜑 → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)) |
| 19 | df-rex 3057 | . 2 ⊢ (∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦 ↔ ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)) | |
| 20 | 18, 19 | sylibr 234 | 1 ⊢ (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1780 ∈ wcel 2111 {cab 2709 ∃wrex 3056 ∪ ciun 4936 class class class wbr 5086 Scott cscott 44268 Coll ccoll 44283 |
| 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 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-int 4893 df-iun 4938 df-iin 4939 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-ov 7344 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-r1 9652 df-rank 9653 df-scott 44269 df-coll 44284 |
| This theorem is referenced by: cpcoll2d 44292 |
| Copyright terms: Public domain | W3C validator |