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

Theorem omnimkv 7023
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 7001 . . . 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 175 . . 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 711 . . . . . . 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 719 . . . . . 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 1851 . . 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 7020 . 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 166 1  |-  ( A  e. Omni  ->  A  e. Markov )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    \/ wo 697   A.wal 1329    = wceq 1331    e. wcel 1480   A.wral 2414   E.wrex 2415   (/)c0 3358   -->wf 5114   ` cfv 5118   1oc1o 6299   2oc2o 6300  Omnicomni 6997  Markovcmarkov 7018
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-fn 5121  df-f 5122  df-omni 6999  df-markov 7019
This theorem is referenced by:  exmidmp  7024
  Copyright terms: Public domain W3C validator