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

Theorem omnimkv 7354
Description: An omniscient set is Markov. In particular, the case where 𝐴 is ω means that the Limited Principle of Omniscience (LPO) implies Markov's Principle (MP). (Contributed by Jim Kingdon, 18-Mar-2023.)
Assertion
Ref Expression
omnimkv (𝐴 ∈ Omni → 𝐴 ∈ Markov)

Proof of Theorem omnimkv
Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isomni 7334 . . . 4 (𝐴 ∈ Omni → (𝐴 ∈ Omni ↔ ∀𝑓(𝑓:𝐴⟶2o → (∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o))))
21ibi 176 . . 3 (𝐴 ∈ Omni → ∀𝑓(𝑓:𝐴⟶2o → (∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o)))
3 pm2.53 729 . . . . . . 7 ((∀𝑥𝐴 (𝑓𝑥) = 1o ∨ ∃𝑥𝐴 (𝑓𝑥) = ∅) → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅))
43orcoms 737 . . . . . 6 ((∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o) → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅))
54a1i 9 . . . . 5 (𝐴 ∈ Omni → ((∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o) → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅)))
65imim2d 54 . . . 4 (𝐴 ∈ Omni → ((𝑓:𝐴⟶2o → (∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o)) → (𝑓:𝐴⟶2o → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅))))
76alimdv 1927 . . 3 (𝐴 ∈ Omni → (∀𝑓(𝑓:𝐴⟶2o → (∃𝑥𝐴 (𝑓𝑥) = ∅ ∨ ∀𝑥𝐴 (𝑓𝑥) = 1o)) → ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅))))
82, 7mpd 13 . 2 (𝐴 ∈ Omni → ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅)))
9 ismkv 7351 . 2 (𝐴 ∈ Omni → (𝐴 ∈ Markov ↔ ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥𝐴 (𝑓𝑥) = 1o → ∃𝑥𝐴 (𝑓𝑥) = ∅))))
108, 9mpbird 167 1 (𝐴 ∈ Omni → 𝐴 ∈ Markov)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wo 715  wal 1395   = wceq 1397  wcel 2202  wral 2510  wrex 2511  c0 3494  wf 5322  cfv 5326  1oc1o 6574  2oc2o 6575  Omnicomni 7332  Markovcmarkov 7349
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-fn 5329  df-f 5330  df-omni 7333  df-markov 7350
This theorem is referenced by:  exmidmp  7355
  Copyright terms: Public domain W3C validator