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

Theorem omnimkv 7398
Description: An omniscient set is Markov. In particular, the case where  A is  om means that the Limited Principle of Omniscience (LPO) implies Markov's Principle (MP). (Contributed by Jim Kingdon, 18-Mar-2023.)
Assertion
Ref Expression
omnimkv  |-  ( A  e. Omni  ->  A  e. Markov )

Proof of Theorem omnimkv
Dummy variables  f  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isomni 7378 . . . 4  |-  ( A  e. Omni  ->  ( A  e. Omni  <->  A. f ( f : A --> 2o  ->  ( E. x  e.  A  ( f `  x
)  =  (/)  \/  A. x  e.  A  (
f `  x )  =  1o ) ) ) )
21ibi 176 . . 3  |-  ( A  e. Omni  ->  A. f ( f : A --> 2o  ->  ( E. x  e.  A  ( f `  x
)  =  (/)  \/  A. x  e.  A  (
f `  x )  =  1o ) ) )
3 pm2.53 730 . . . . . . 7  |-  ( ( A. x  e.  A  ( f `  x
)  =  1o  \/  E. x  e.  A  ( f `  x )  =  (/) )  ->  ( -.  A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) )
43orcoms 738 . . . . . 6  |-  ( ( E. x  e.  A  ( f `  x
)  =  (/)  \/  A. x  e.  A  (
f `  x )  =  1o )  ->  ( -.  A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) )
54a1i 9 . . . . 5  |-  ( A  e. Omni  ->  ( ( E. x  e.  A  ( f `  x )  =  (/)  \/  A. x  e.  A  ( f `  x )  =  1o )  ->  ( -.  A. x  e.  A  ( f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) )
65imim2d 54 . . . 4  |-  ( A  e. Omni  ->  ( ( f : A --> 2o  ->  ( E. x  e.  A  ( f `  x
)  =  (/)  \/  A. x  e.  A  (
f `  x )  =  1o ) )  -> 
( f : A --> 2o  ->  ( -.  A. x  e.  A  (
f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
76alimdv 1927 . . 3  |-  ( A  e. Omni  ->  ( A. f
( f : A --> 2o  ->  ( E. x  e.  A  ( f `  x )  =  (/)  \/ 
A. x  e.  A  ( f `  x
)  =  1o ) )  ->  A. f
( f : A --> 2o  ->  ( -.  A. x  e.  A  (
f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
82, 7mpd 13 . 2  |-  ( A  e. Omni  ->  A. f ( f : A --> 2o  ->  ( -.  A. x  e.  A  ( f `  x )  =  1o 
->  E. x  e.  A  ( f `  x
)  =  (/) ) ) )
9 ismkv 7395 . 2  |-  ( A  e. Omni  ->  ( A  e. Markov  <->  A. f ( f : A --> 2o  ->  ( -.  A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
108, 9mpbird 167 1  |-  ( A  e. Omni  ->  A  e. Markov )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 716   A.wal 1396    = wceq 1398    e. wcel 2202   A.wral 2511   E.wrex 2512   (/)c0 3496   -->wf 5329   ` cfv 5333   1oc1o 6618   2oc2o 6619  Omnicomni 7376  Markovcmarkov 7393
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-fn 5336  df-f 5337  df-omni 7377  df-markov 7394
This theorem is referenced by:  exmidmp  7399
  Copyright terms: Public domain W3C validator