HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem cplem1 4703
Description: Lemma for the Collection Principle cp 4705.
Hypotheses
Ref Expression
cplem1.1 |- C = {y e. B | A.z e. B (rank` y) (_ (rank` z)}
cplem1.2 |- D = U_x e. A C
Assertion
Ref Expression
cplem1 |- A.x e. A (B =/= (/) -> (B i^i D) =/= (/))
Distinct variable groups:   x,y,z,A   y,B,z

Proof of Theorem cplem1
StepHypRef Expression
1 cplem1.1 . . . . . . . . 9 |- C = {y e. B | A.z e. B (rank` y) (_ (rank` z)}
2 ssrab2 2128 . . . . . . . . 9 |- {y e. B | A.z e. B (rank` y) (_ (rank` z)} (_ B
31, 2eqsstr 2088 . . . . . . . 8 |- C (_ B
43sseli 2062 . . . . . . 7 |- (w e. C -> w e. B)
54a1i 8 . . . . . 6 |- (x e. A -> (w e. C -> w e. B))
6 ssiun2 2589 . . . . . . . 8 |- (x e. A -> C (_ U_x e. A C)
7 cplem1.2 . . . . . . . 8 |- D = U_x e. A C
86, 7syl6ssr 2105 . . . . . . 7 |- (x e. A -> C (_ D)
98sseld 2064 . . . . . 6 |- (x e. A -> (w e. C -> w e. D))
105, 9jcad 599 . . . . 5 |- (x e. A -> (w e. C -> (w e. B /\ w e. D)))
11 inelcm 2320 . . . . 5 |- ((w e. B /\ w e. D) -> (B i^i D) =/= (/))
1210, 11syl6 22 . . . 4 |- (x e. A -> (w e. C -> (B i^i D) =/= (/)))
131219.23adv 1213 . . 3 |- (x e. A -> (E.w w e. C -> (B i^i D) =/= (/)))
14 scott0 4700 . . . . . 6 |- (B = (/) <-> {y e. B | A.z e. B (rank` y) (_ (rank` z)} = (/))
151eqeq1i 1480 . . . . . 6 |- (C = (/) <-> {y e. B | A.z e. B (rank` y) (_ (rank` z)} = (/))
1614, 15bitr4 176 . . . . 5 |- (B = (/) <-> C = (/))
1716necon3bii 1596 . . . 4 |- (B =/= (/) <-> C =/= (/))
18 ne0 2285 . . . 4 |- (C =/= (/) <-> E.w w e. C)
1917, 18bitr 173 . . 3 |- (B =/= (/) <-> E.w w e. C)
2013, 19syl5ib 206 . 2 |- (x e. A -> (B =/= (/) -> (B i^i D) =/= (/)))
2120rgen 1696 1 |- A.x e. A (B =/= (/) -> (B i^i D) =/= (/))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   = wceq 955   e. wcel 957  E.wex 979   =/= wne 1583  A.wral 1643  {crab 1646   i^i cin 2043   (_ wss 2044  (/)c0 2277  U_ciun 2562  ` cfv 3178  rankcrnk 4625
This theorem is referenced by:  cplem2 4704
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-rep 2689  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775  ax-un 2862  ax-reg 4576  ax-inf2 4608
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-rab 1650  df-v 1809  df-sbc 1939  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-if 2359  df-pw 2399  df-sn 2409  df-pr 2410  df-tp 2412  df-op 2413  df-uni 2500  df-int 2530  df-iun 2564  df-iin 2565  df-br 2616  df-opab 2663  df-tr 2677  df-eprel 2828  df-id 2831  df-po 2836  df-so 2846  df-fr 2913  df-we 2930  df-ord 2947  df-on 2948  df-lim 2949  df-suc 2950  df-om 3128  df-xp 3180  df-rel 3181  df-cnv 3182  df-co 3183  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fun 3188  df-fn 3189  df-fv 3194  df-rdg 3927  df-r1 4626  df-rank 4627
Copyright terms: Public domain