Theorem omnimkv 7154

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.

Step	Hyp	Ref	Expression
1		isomni 7134	. . . 4 ⊢ (𝐴 ∈ Omni → (𝐴 ∈ Omni ↔ ∀𝑓(𝑓:𝐴⟶2o → (∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o))))
2	1	ibi 176	. . 3 ⊢ (𝐴 ∈ Omni → ∀𝑓(𝑓:𝐴⟶2o → (∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o)))
3		pm2.53 722	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o ∨ ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅) → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅))
4	3	orcoms 730	. . . . . 6 ⊢ ((∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o) → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅))
5	4	a1i 9	. . . . 5 ⊢ (𝐴 ∈ Omni → ((∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o) → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅)))
6	5	imim2d 54	. . . 4 ⊢ (𝐴 ∈ Omni → ((𝑓:𝐴⟶2o → (∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o)) → (𝑓:𝐴⟶2o → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅))))
7	6	alimdv 1879	. . 3 ⊢ (𝐴 ∈ Omni → (∀𝑓(𝑓:𝐴⟶2o → (∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅ ∨ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o)) → ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅))))
8	2, 7	mpd 13	. 2 ⊢ (𝐴 ∈ Omni → ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅)))
9		ismkv 7151	. 2 ⊢ (𝐴 ∈ Omni → (𝐴 ∈ Markov ↔ ∀𝑓(𝑓:𝐴⟶2o → (¬ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) = 1o → ∃𝑥 ∈ 𝐴 (𝑓‘𝑥) = ∅))))
10	8, 9	mpbird 167	1 ⊢ (𝐴 ∈ Omni → 𝐴 ∈ Markov)

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 708  ∀wal 1351   = wceq 1353   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  ∅c0 3423  ⟶wf 5213  ‘cfv 5217  1_oc1o 6410  2_oc2o 6411  Omnicomni 7132  Markovcmarkov 7149

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-fn 5220  df-f 5221  df-omni 7133  df-markov 7150

This theorem is referenced by:  exmidmp  7155