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 44702
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 3435 . . . . . . 7 𝑦 ∈ V
4 breq2 5076 . . . . . . 7 (𝑧 = 𝑦 → (𝑥𝐹𝑧𝑥𝐹𝑦))
53, 4elab 3617 . . . . . 6 (𝑦 ∈ {𝑧𝑥𝐹𝑧} ↔ 𝑥𝐹𝑦)
62, 5sylibr 235 . . . . 5 (𝜑𝑦 ∈ {𝑧𝑥𝐹𝑧})
7619.8ad 2194 . . . 4 (𝜑 → ∃𝑦 𝑦 ∈ {𝑧𝑥𝐹𝑧})
87scotteld 44690 . . 3 (𝜑 → ∃𝑦 𝑦 ∈ Scott {𝑧𝑥𝐹𝑧})
9 ssiun2 4977 . . . . . . . 8 (𝑥𝐴 → Scott {𝑧𝑥𝐹𝑧} ⊆ 𝑥𝐴 Scott {𝑧𝑥𝐹𝑧})
10 dfcoll2 44696 . . . . . . . 8 (𝐹 Coll 𝐴) = 𝑥𝐴 Scott {𝑧𝑥𝐹𝑧}
119, 10sseqtrrdi 3956 . . . . . . 7 (𝑥𝐴 → Scott {𝑧𝑥𝐹𝑧} ⊆ (𝐹 Coll 𝐴))
1211sselda 3915 . . . . . 6 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → 𝑦 ∈ (𝐹 Coll 𝐴))
134elscottab 44688 . . . . . . 7 (𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → 𝑥𝐹𝑦)
1413adantl 482 . . . . . 6 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → 𝑥𝐹𝑦)
1512, 14jca 516 . . . . 5 ((𝑥𝐴𝑦 ∈ Scott {𝑧𝑥𝐹𝑧}) → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
1615ex 413 . . . 4 (𝑥𝐴 → (𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → (𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)))
1716eximdv 1924 . . 3 (𝑥𝐴 → (∃𝑦 𝑦 ∈ Scott {𝑧𝑥𝐹𝑧} → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦)))
181, 8, 17sylc 65 . 2 (𝜑 → ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
19 df-rex 3064 . 2 (∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦 ↔ ∃𝑦(𝑦 ∈ (𝐹 Coll 𝐴) ∧ 𝑥𝐹𝑦))
2018, 19sylibr 235 1 (𝜑 → ∃𝑦 ∈ (𝐹 Coll 𝐴)𝑥𝐹𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wex 1786  wcel 2119  {cab 2717  wrex 3063   ciun 4921   class class class wbr 5072  Scott cscott 44679   Coll ccoll 44694
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-iin 4924  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-r1 9679  df-rank 9680  df-scott 44680  df-coll 44695
This theorem is referenced by:  cpcoll2d  44703
  Copyright terms: Public domain W3C validator