MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ac9s Unicode version

Theorem ac9s 8306
Description: An Axiom of Choice equivalent: the infinite Cartesian product of nonempty classes is nonempty. Axiom of Choice (second form) of [Enderton] p. 55 and its converse. This is a stronger version of the axiom in Enderton, with no existence requirement for the family of classes  B ( x ) (achieved via the Collection Principle cp 7748). (Contributed by NM, 29-Sep-2006.)
Hypothesis
Ref Expression
ac9.1  |-  A  e. 
_V
Assertion
Ref Expression
ac9s  |-  ( A. x  e.  A  B  =/=  (/)  <->  X_ x  e.  A  B  =/=  (/) )
Distinct variable group:    x, A
Allowed substitution hint:    B( x)

Proof of Theorem ac9s
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 ac9.1 . . . 4  |-  A  e. 
_V
21ac6s4 8303 . . 3  |-  ( A. x  e.  A  B  =/=  (/)  ->  E. f
( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
3 n0 3580 . . . 4  |-  ( X_ x  e.  A  B  =/=  (/)  <->  E. f  f  e.  X_ x  e.  A  B )
4 vex 2902 . . . . . 6  |-  f  e. 
_V
54elixp 7005 . . . . 5  |-  ( f  e.  X_ x  e.  A  B 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
65exbii 1589 . . . 4  |-  ( E. f  f  e.  X_ x  e.  A  B  <->  E. f ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B
) )
73, 6bitr2i 242 . . 3  |-  ( E. f ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B
)  <->  X_ x  e.  A  B  =/=  (/) )
82, 7sylib 189 . 2  |-  ( A. x  e.  A  B  =/=  (/)  ->  X_ x  e.  A  B  =/=  (/) )
9 ixpn0 7030 . 2  |-  ( X_ x  e.  A  B  =/=  (/)  ->  A. x  e.  A  B  =/=  (/) )
108, 9impbii 181 1  |-  ( A. x  e.  A  B  =/=  (/)  <->  X_ x  e.  A  B  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    /\ wa 359   E.wex 1547    e. wcel 1717    =/= wne 2550   A.wral 2649   _Vcvv 2899   (/)c0 3571    Fn wfn 5389   ` cfv 5394   X_cixp 6999
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368  ax-rep 4261  ax-sep 4271  ax-nul 4279  ax-pow 4318  ax-pr 4344  ax-un 4641  ax-reg 7493  ax-inf2 7529  ax-ac2 8276
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2242  df-mo 2243  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ne 2552  df-ral 2654  df-rex 2655  df-reu 2656  df-rmo 2657  df-rab 2658  df-v 2901  df-sbc 3105  df-csb 3195  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-pss 3279  df-nul 3572  df-if 3683  df-pw 3744  df-sn 3763  df-pr 3764  df-tp 3765  df-op 3766  df-uni 3958  df-int 3993  df-iun 4037  df-iin 4038  df-br 4154  df-opab 4208  df-mpt 4209  df-tr 4244  df-eprel 4435  df-id 4439  df-po 4444  df-so 4445  df-fr 4482  df-se 4483  df-we 4484  df-ord 4525  df-on 4526  df-lim 4527  df-suc 4528  df-om 4786  df-xp 4824  df-rel 4825  df-cnv 4826  df-co 4827  df-dm 4828  df-rn 4829  df-res 4830  df-ima 4831  df-iota 5358  df-fun 5396  df-fn 5397  df-f 5398  df-f1 5399  df-fo 5400  df-f1o 5401  df-fv 5402  df-isom 5403  df-riota 6485  df-recs 6569  df-rdg 6604  df-ixp 7000  df-en 7046  df-r1 7623  df-rank 7624  df-card 7759  df-ac 7930
  Copyright terms: Public domain W3C validator