Users' Mathboxes Mathbox for Rohan Ridenour < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cpcolld Structured version   Visualization version   GIF version

Theorem cpcolld 44499
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.
StepHypRef Expression
1 cpcolld.1 . . 3 (𝜑𝑥𝐴)
2 cpcolld.2 . . . . . 6 (𝜑𝑥𝐹𝑦)
3 vex 3444 . . . . . . 7 𝑦 ∈ V
4 breq2 5102 . . . . . . 7 (𝑧 = 𝑦 → (𝑥𝐹𝑧𝑥𝐹𝑦))
53, 4elab 3634 . . . . . 6 (𝑦 ∈ {𝑧𝑥𝐹𝑧} ↔ 𝑥𝐹𝑦)
62, 5sylibr 234 . . . . 5 (𝜑𝑦 ∈ {𝑧𝑥𝐹𝑧})
7619.8ad 2189 . . . 4 (𝜑 → ∃𝑦 𝑦 ∈ {𝑧𝑥𝐹𝑧})
87scotteld 44487 . . 3 (𝜑 → ∃𝑦 𝑦 ∈ Scott {𝑧𝑥𝐹𝑧})
9 ssiun2 5003 . . . . . . . 8 (𝑥𝐴 → Scott {𝑧𝑥𝐹𝑧} ⊆ 𝑥𝐴 Scott {𝑧𝑥𝐹𝑧})
10 dfcoll2 44493 . . . . . . . 8 (𝐹 Coll 𝐴) = 𝑥𝐴 Scott {𝑧𝑥𝐹𝑧}
119, 10sseqtrrdi 3975 . . . . . . 7 (𝑥𝐴 → Scott {𝑧𝑥𝐹𝑧} ⊆ (𝐹 Coll 𝐴))
1211sselda 3933 . . . . . 6 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → 𝑦 ∈ (𝐹 Coll 𝐴))
134elscottab 44485 . . . . . . 7 (𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → 𝑥𝐹𝑦)
1413adantl 481 . . . . . 6 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → 𝑥𝐹𝑦)
1512, 14jca 511 . . . . 5 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
1615ex 412 . . . 4 (𝑥𝐴 → (𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)))
1716eximdv 1918 . . 3 (𝑥𝐴 → (∃𝑦 𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)))
181, 8, 17sylc 65 . 2 (𝜑 → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
19 df-rex 3061 . 2 (∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦 ↔ ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
2018, 19sylibr 234 1 (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wex 1780  wcel 2113  {cab 2714  wrex 3060   ciun 4946   class class class wbr 5098  Scott cscott 44476   Coll ccoll 44491
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-iin 4949  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-r1 9676  df-rank 9677  df-scott 44477  df-coll 44492
This theorem is referenced by:  cpcoll2d  44500
  Copyright terms: Public domain W3C validator