Theorem cpcolld 44611

Description: Property of the collection operation. (Contributed by Rohan Ridenour, 11-Aug-2023.)

Hypotheses

Ref	Expression
cpcolld.1	⊢ (𝜑 → 𝑥 ∈ 𝐴)
cpcolld.2	⊢ (𝜑 → 𝑥𝐹𝑦)

Assertion

Ref	Expression
cpcolld	⊢ (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦)

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐴,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem cpcolld

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cpcolld.1	. . 3 ⊢ (𝜑 → 𝑥 ∈ 𝐴)
2		cpcolld.2	. . . . . 6 ⊢ (𝜑 → 𝑥𝐹𝑦)
3		vex 3446	. . . . . . 7 ⊢ 𝑦 ∈ V
4		breq2 5104	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑥𝐹𝑧 ↔ 𝑥𝐹𝑦))
5	3, 4	elab 3636	. . . . . 6 ⊢ (𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧} ↔ 𝑥𝐹𝑦)
6	2, 5	sylibr 234	. . . . 5 ⊢ (𝜑 → 𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧})
7	6	19.8ad 2190	. . . 4 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ {𝑧 ∣ 𝑥𝐹𝑧})
8	7	scotteld 44599	. . 3 ⊢ (𝜑 → ∃𝑦 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧})
9		ssiun2 5005	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → Scott {𝑧 ∣ 𝑥𝐹𝑧} ⊆ ∪ 𝑥 ∈ 𝐴 Scott {𝑧 ∣ 𝑥𝐹𝑧})
10		dfcoll2 44605	. . . . . . . 8 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott {𝑧 ∣ 𝑥𝐹𝑧}
11	9, 10	sseqtrrdi 3977	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → Scott {𝑧 ∣ 𝑥𝐹𝑧} ⊆ (𝐹 Coll 𝐴))
12	11	sselda 3935	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧}) → 𝑦 ∈ (𝐹 Coll 𝐴))
13	4	elscottab 44597	. . . . . . 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 1919	. . 3 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 𝑦 ∈ Scott {𝑧 ∣ 𝑥𝐹𝑧} → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)))
18	1, 8, 17	sylc 65	. 2 ⊢ (𝜑 → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
19		df-rex 3063	. 2 ⊢ (∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦 ↔ ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
20	18, 19	sylibr 234	1 ⊢ (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦)

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1781   ∈ wcel 2114  {cab 2715  ∃wrex 3062  ∪ ciun 4948   class class class wbr 5100  Scott cscott 44588   Coll ccoll 44603

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-r1 9688  df-rank 9689  df-scott 44589  df-coll 44604

This theorem is referenced by:  cpcoll2d  44612