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

Theorem scottex 4688
Description: Scott's trick collects all sets that have a certain property and are of smallest possible rank. This theorem shows that the resulting collection, expressed as in Equation 9.3 of [Jech] p. 72, is a set.
Assertion
Ref Expression
scottex |- {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V
Distinct variable group:   x,y,A

Proof of Theorem scottex
StepHypRef Expression
1 0ex 2701 . . . 4 |- (/) e. V
2 eleq1 1526 . . . 4 |- (A = (/) -> (A e. V <-> (/) e. V))
31, 2mpbiri 194 . . 3 |- (A = (/) -> A e. V)
4 rabexg 2714 . . 3 |- (A e. V -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
53, 4syl 10 . 2 |- (A = (/) -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
6 n0 2279 . . 3 |- (-. A = (/) <-> E.y y e. A)
7 hbra1 1679 . . . . . 6 |- (A.y e. A (rank` x) (_ (rank` y) -> A.yA.y e. A (rank` x) (_ (rank` y))
8 ax-17 968 . . . . . 6 |- (z e. A -> A.y z e. A)
97, 8hbrab 1765 . . . . 5 |- (z e. {x e. A | A.y e. A (rank` x) (_ (rank` y)} -> A.y z e. {x e. A | A.y e. A (rank` x) (_ (rank` y)})
10 ax-17 968 . . . . 5 |- (z e. V -> A.y z e. V)
119, 10hbel 1558 . . . 4 |- ({x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V -> A.y{x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
12 ra4 1686 . . . . . . . . 9 |- (A.y e. A (rank` x) (_ (rank` y) -> (y e. A -> (rank` x) (_ (rank` y)))
1312com12 11 . . . . . . . 8 |- (y e. A -> (A.y e. A (rank` x) (_ (rank` y) -> (rank` x) (_ (rank` y)))
1413a1d 12 . . . . . . 7 |- (y e. A -> (x e. A -> (A.y e. A (rank` x) (_ (rank` y) -> (rank` x) (_ (rank` y))))
1514r19.21aiv 1705 . . . . . 6 |- (y e. A -> A.x e. A (A.y e. A (rank` x) (_ (rank` y) -> (rank` x) (_ (rank` y)))
16 ss2rab 2113 . . . . . 6 |- ({x e. A | A.y e. A (rank` x) (_ (rank` y)} (_ {x e. A | (rank` x) (_ (rank` y)} <-> A.x e. A (A.y e. A (rank` x) (_ (rank` y) -> (rank` x) (_ (rank` y)))
1715, 16sylibr 200 . . . . 5 |- (y e. A -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} (_ {x e. A | (rank` x) (_ (rank` y)})
18 rankon 4643 . . . . . . . 8 |- (rank` y) e. On
19 fveq2 3709 . . . . . . . . . . . 12 |- (x = w -> (rank` x) = (rank`
w))
2019sseq1d 2078 . . . . . . . . . . 11 |- (x = w -> ((rank` x) (_ (rank` y) <-> (rank` w) (_ (rank` y)))
2120elrab 1896 . . . . . . . . . 10 |- (w e. {x e. A | (rank` x) (_ (rank` y)} <-> (w e. A /\ (rank`
w) (_ (rank` y)))
2221pm3.27bi 326 . . . . . . . . 9 |- (w e. {x e. A | (rank` x) (_ (rank` y)} -> (rank`
w) (_ (rank` y))
2322rgen 1690 . . . . . . . 8 |- A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ (rank` y)
24 sseq2 2073 . . . . . . . . . 10 |- (z = (rank`
y) -> ((rank` w) (_ z <-> (rank` w) (_ (rank` y)))
2524ralbidv 1655 . . . . . . . . 9 |- (z = (rank`
y) -> (A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ z <-> A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ (rank` y)))
2625rcla4ev 1868 . . . . . . . 8 |- (((rank` y) e. On /\ A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ (rank` y)) -> E.z e. On A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ z)
2718, 23, 26mp2an 695 . . . . . . 7 |- E.z e. On A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ z
28 bndrank 4654 . . . . . . 7 |- (E.z e. On A.w e. {x e. A | (rank` x) (_ (rank` y)} (rank` w) (_ z -> {x e. A | (rank` x) (_ (rank` y)} e. V)
2927, 28ax-mp 7 . . . . . 6 |- {x e. A | (rank` x) (_ (rank` y)} e. V
3029ssex 2709 . . . . 5 |- ({x e. A | A.y e. A (rank` x) (_ (rank` y)} (_ {x e. A | (rank` x) (_ (rank` y)} -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
3117, 30syl 10 . . . 4 |- (y e. A -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
3211, 3119.23ai 1060 . . 3 |- (E.y y e. A -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
336, 32sylbi 199 . 2 |- (-. A = (/) -> {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V)
345, 33pm2.61i 126 1 |- {x e. A | A.y e. A (rank` x) (_ (rank` y)} e. V
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   = wceq 953   e. wcel 955  E.wex 977  A.wral 1637  E.wrex 1638  {crab 1640  Vcvv 1802   (_ wss 2037  (/)c0 2270  Oncon0 2938  ` cfv 3172  rankcrnk 4614
This theorem is referenced by:  scottexs 4690  cplem2 4693  kardex 4697
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857  ax-reg 4565  ax-inf2 4597
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-rab 1644  df-v 1803  df-sbc 1932  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-if 2352  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-int 2524  df-iun 2558  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-id 2824  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-lim 2943  df-suc 2944  df-om 3122  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-fun 3182  df-fn 3183  df-fv 3188  df-rdg 3917  df-r1 4615  df-rank 4616
Copyright terms: Public domain