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

Theorem exmidomniim 7475
Description: Given excluded middle, every set is omniscient. Remark following Definition 3.1 of [Pierik], p. 14. This is one direction of the biconditional exmidomni 7476. (Contributed by Jim Kingdon, 29-Jun-2022.)
Assertion
Ref Expression
exmidomniim (EXMID → ∀𝑥 𝑥 ∈ Omni)

Proof of Theorem exmidomniim
Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 exmidexmid 4331 . . . . . . . . 9 (EXMIDDECID𝑦𝑥 (𝑓𝑦) = 1o)
2 exmiddc 848 . . . . . . . . 9 (DECID𝑦𝑥 (𝑓𝑦) = 1o → (∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ¬ ∀𝑦𝑥 (𝑓𝑦) = 1o))
31, 2syl 14 . . . . . . . 8 (EXMID → (∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ¬ ∀𝑦𝑥 (𝑓𝑦) = 1o))
43orcomd 741 . . . . . . 7 (EXMID → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
54adantr 276 . . . . . 6 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
6 ffvelcdm 5835 . . . . . . . . . . . . . 14 ((𝑓:𝑥⟶2o𝑦𝑥) → (𝑓𝑦) ∈ 2o)
7 df2o3 6696 . . . . . . . . . . . . . 14 2o = {∅, 1o}
86, 7eleqtrdi 2331 . . . . . . . . . . . . 13 ((𝑓:𝑥⟶2o𝑦𝑥) → (𝑓𝑦) ∈ {∅, 1o})
9 elpri 3731 . . . . . . . . . . . . 13 ((𝑓𝑦) ∈ {∅, 1o} → ((𝑓𝑦) = ∅ ∨ (𝑓𝑦) = 1o))
108, 9syl 14 . . . . . . . . . . . 12 ((𝑓:𝑥⟶2o𝑦𝑥) → ((𝑓𝑦) = ∅ ∨ (𝑓𝑦) = 1o))
1110ord 736 . . . . . . . . . . 11 ((𝑓:𝑥⟶2o𝑦𝑥) → (¬ (𝑓𝑦) = ∅ → (𝑓𝑦) = 1o))
1211ralimdva 2617 . . . . . . . . . 10 (𝑓:𝑥⟶2o → (∀𝑦𝑥 ¬ (𝑓𝑦) = ∅ → ∀𝑦𝑥 (𝑓𝑦) = 1o))
1312con3d 640 . . . . . . . . 9 (𝑓:𝑥⟶2o → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1413adantl 277 . . . . . . . 8 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
15 exmidexmid 4331 . . . . . . . . . 10 (EXMIDDECID𝑦𝑥 (𝑓𝑦) = ∅)
16 dfrex2dc 2541 . . . . . . . . . 10 (DECID𝑦𝑥 (𝑓𝑦) = ∅ → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1715, 16syl 14 . . . . . . . . 9 (EXMID → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1817adantr 276 . . . . . . . 8 ((EXMID𝑓:𝑥⟶2o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1914, 18sylibrd 169 . . . . . . 7 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ∃𝑦𝑥 (𝑓𝑦) = ∅))
2019orim1d 799 . . . . . 6 ((EXMID𝑓:𝑥⟶2o) → ((¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
215, 20mpd 13 . . . . 5 ((EXMID𝑓:𝑥⟶2o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
2221ex 115 . . . 4 (EXMID → (𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
2322alrimiv 1927 . . 3 (EXMID → ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
24 isomni 7470 . . . 4 (𝑥 ∈ V → (𝑥 ∈ Omni ↔ ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))))
2524elv 2825 . . 3 (𝑥 ∈ Omni ↔ ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
2623, 25sylibr 134 . 2 (EXMID𝑥 ∈ Omni)
2726alrimiv 1927 1 (EXMID → ∀𝑥 𝑥 ∈ Omni)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 720  DECID wdc 846  wal 1400   = wceq 1402  wcel 2209  wral 2528  wrex 2529  Vcvv 2821  c0 3520  {cpr 3709  EXMIDwem 4329  wf 5371  cfv 5375  1oc1o 6674  2oc2o 6675  Omnicomni 7468
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-exmid 4330  df-id 4436  df-suc 4514  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383  df-1o 6681  df-2o 6682  df-omni 7469
This theorem is referenced by:  exmidomni  7476
  Copyright terms: Public domain W3C validator