ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cc4 Unicode version

Theorem cc4 7417
Description: Countable choice by showing the existence of a function 
f which can choose a value at each index 
n such that  ch holds. (Contributed by Mario Carneiro, 7-Apr-2013.) (Revised by Jim Kingdon, 1-May-2024.)
Hypotheses
Ref Expression
cc4.cc  |-  ( ph  -> CCHOICE )
cc4.1  |-  ( ph  ->  A  e.  V )
cc4.2  |-  ( ph  ->  N  ~~  om )
cc4.3  |-  ( x  =  ( f `  n )  ->  ( ps 
<->  ch ) )
cc4.m  |-  ( ph  ->  A. n  e.  N  E. x  e.  A  ps )
Assertion
Ref Expression
cc4  |-  ( ph  ->  E. f ( f : N --> A  /\  A. n  e.  N  ch ) )
Distinct variable groups:    A, f, n, x    f, N, n    ch, x    ph, f, n    ps, f
Allowed substitution hints:    ph( x)    ps( x, n)    ch( f, n)    N( x)    V( x, f, n)

Proof of Theorem cc4
StepHypRef Expression
1 cc4.cc . 2  |-  ( ph  -> CCHOICE )
2 cc4.1 . 2  |-  ( ph  ->  A  e.  V )
3 nfcv 2350 . 2  |-  F/_ n A
4 cc4.2 . 2  |-  ( ph  ->  N  ~~  om )
5 cc4.3 . 2  |-  ( x  =  ( f `  n )  ->  ( ps 
<->  ch ) )
6 cc4.m . 2  |-  ( ph  ->  A. n  e.  N  E. x  e.  A  ps )
71, 2, 3, 4, 5, 6cc4f 7416 1  |-  ( ph  ->  E. f ( f : N --> A  /\  A. n  e.  N  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373   E.wex 1516    e. wcel 2178   A.wral 2486   E.wrex 2487   class class class wbr 4059   omcom 4656   -->wf 5286   ` cfv 5290    ~~ cen 6848  CCHOICEwacc 7409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-iinf 4654
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-2nd 6250  df-er 6643  df-en 6851  df-cc 7410
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator