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

Theorem iswomni 7052
 Description: The predicate of being weakly omniscient. (Contributed by Jim Kingdon, 9-Jun-2024.)
Assertion
Ref Expression
iswomni (𝐴𝑉 → (𝐴 ∈ WOmni ↔ ∀𝑓(𝑓:𝐴⟶2oDECID𝑥𝐴 (𝑓𝑥) = 1o)))
Distinct variable group:   𝐴,𝑓,𝑥
Allowed substitution hints:   𝑉(𝑥,𝑓)

Proof of Theorem iswomni
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 feq2 5266 . . . 4 (𝑦 = 𝐴 → (𝑓:𝑦⟶2o𝑓:𝐴⟶2o))
2 raleq 2630 . . . . 5 (𝑦 = 𝐴 → (∀𝑥𝑦 (𝑓𝑥) = 1o ↔ ∀𝑥𝐴 (𝑓𝑥) = 1o))
32dcbid 824 . . . 4 (𝑦 = 𝐴 → (DECID𝑥𝑦 (𝑓𝑥) = 1oDECID𝑥𝐴 (𝑓𝑥) = 1o))
41, 3imbi12d 233 . . 3 (𝑦 = 𝐴 → ((𝑓:𝑦⟶2oDECID𝑥𝑦 (𝑓𝑥) = 1o) ↔ (𝑓:𝐴⟶2oDECID𝑥𝐴 (𝑓𝑥) = 1o)))
54albidv 1797 . 2 (𝑦 = 𝐴 → (∀𝑓(𝑓:𝑦⟶2oDECID𝑥𝑦 (𝑓𝑥) = 1o) ↔ ∀𝑓(𝑓:𝐴⟶2oDECID𝑥𝐴 (𝑓𝑥) = 1o)))
6 df-womni 7051 . 2 WOmni = {𝑦 ∣ ∀𝑓(𝑓:𝑦⟶2oDECID𝑥𝑦 (𝑓𝑥) = 1o)}
75, 6elab2g 2836 1 (𝐴𝑉 → (𝐴 ∈ WOmni ↔ ∀𝑓(𝑓:𝐴⟶2oDECID𝑥𝐴 (𝑓𝑥) = 1o)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 104  DECID wdc 820  ∀wal 1330   = wceq 1332   ∈ wcel 1481  ∀wral 2417  ⟶wf 5129  ‘cfv 5133  1oc1o 6316  2oc2o 6317  WOmnicwomni 7050 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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-dc 821  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-v 2692  df-fn 5136  df-f 5137  df-womni 7051 This theorem is referenced by:  iswomnimap  7053  omniwomnimkv  7054
 Copyright terms: Public domain W3C validator