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

Theorem exmidomniim 7445
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 7446. (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 4314 . . . . . . . . 9 (EXMIDDECID𝑦𝑥 (𝑓𝑦) = 1o)
2 exmiddc 844 . . . . . . . . 9 (DECID𝑦𝑥 (𝑓𝑦) = 1o → (∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ¬ ∀𝑦𝑥 (𝑓𝑦) = 1o))
31, 2syl 14 . . . . . . . 8 (EXMID → (∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ¬ ∀𝑦𝑥 (𝑓𝑦) = 1o))
43orcomd 737 . . . . . . 7 (EXMID → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
54adantr 276 . . . . . 6 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
6 ffvelcdm 5815 . . . . . . . . . . . . . 14 ((𝑓:𝑥⟶2o𝑦𝑥) → (𝑓𝑦) ∈ 2o)
7 df2o3 6675 . . . . . . . . . . . . . 14 2o = {∅, 1o}
86, 7eleqtrdi 2327 . . . . . . . . . . . . 13 ((𝑓:𝑥⟶2o𝑦𝑥) → (𝑓𝑦) ∈ {∅, 1o})
9 elpri 3717 . . . . . . . . . . . . 13 ((𝑓𝑦) ∈ {∅, 1o} → ((𝑓𝑦) = ∅ ∨ (𝑓𝑦) = 1o))
108, 9syl 14 . . . . . . . . . . . 12 ((𝑓:𝑥⟶2o𝑦𝑥) → ((𝑓𝑦) = ∅ ∨ (𝑓𝑦) = 1o))
1110ord 732 . . . . . . . . . . 11 ((𝑓:𝑥⟶2o𝑦𝑥) → (¬ (𝑓𝑦) = ∅ → (𝑓𝑦) = 1o))
1211ralimdva 2611 . . . . . . . . . 10 (𝑓:𝑥⟶2o → (∀𝑦𝑥 ¬ (𝑓𝑦) = ∅ → ∀𝑦𝑥 (𝑓𝑦) = 1o))
1312con3d 636 . . . . . . . . 9 (𝑓:𝑥⟶2o → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1413adantl 277 . . . . . . . 8 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
15 exmidexmid 4314 . . . . . . . . . 10 (EXMIDDECID𝑦𝑥 (𝑓𝑦) = ∅)
16 dfrex2dc 2535 . . . . . . . . . 10 (DECID𝑦𝑥 (𝑓𝑦) = ∅ → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1715, 16syl 14 . . . . . . . . 9 (EXMID → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1817adantr 276 . . . . . . . 8 ((EXMID𝑓:𝑥⟶2o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ↔ ¬ ∀𝑦𝑥 ¬ (𝑓𝑦) = ∅))
1914, 18sylibrd 169 . . . . . . 7 ((EXMID𝑓:𝑥⟶2o) → (¬ ∀𝑦𝑥 (𝑓𝑦) = 1o → ∃𝑦𝑥 (𝑓𝑦) = ∅))
2019orim1d 795 . . . . . 6 ((EXMID𝑓:𝑥⟶2o) → ((¬ ∀𝑦𝑥 (𝑓𝑦) = 1o ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
215, 20mpd 13 . . . . 5 ((EXMID𝑓:𝑥⟶2o) → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))
2221ex 115 . . . 4 (EXMID → (𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
2322alrimiv 1923 . . 3 (EXMID → ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
24 isomni 7440 . . . 4 (𝑥 ∈ V → (𝑥 ∈ Omni ↔ ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o))))
2524elv 2819 . . 3 (𝑥 ∈ Omni ↔ ∀𝑓(𝑓:𝑥⟶2o → (∃𝑦𝑥 (𝑓𝑦) = ∅ ∨ ∀𝑦𝑥 (𝑓𝑦) = 1o)))
2623, 25sylibr 134 . 2 (EXMID𝑥 ∈ Omni)
2726alrimiv 1923 1 (EXMID → ∀𝑥 𝑥 ∈ Omni)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716  DECID wdc 842  wal 1396   = wceq 1398  wcel 2205  wral 2522  wrex 2523  Vcvv 2815  c0 3512  {cpr 3695  EXMIDwem 4312  wf 5353  cfv 5357  1oc1o 6653  2oc2o 6654  Omnicomni 7438
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-exmid 4313  df-id 4419  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-1o 6660  df-2o 6661  df-omni 7439
This theorem is referenced by:  exmidomni  7446
  Copyright terms: Public domain W3C validator