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

Theorem exmidundifim 4342
Description: Excluded middle is equivalent to every subset having a complement. Variation of exmidundif 4341 with an implication rather than a biconditional. (Contributed by Jim Kingdon, 16-Feb-2023.)
Assertion
Ref Expression
exmidundifim (EXMID ↔ ∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦))
Distinct variable group:   𝑥,𝑦

Proof of Theorem exmidundifim
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 undifss 3608 . . . . . . 7 (𝑥𝑦 ↔ (𝑥 ∪ (𝑦𝑥)) ⊆ 𝑦)
21biimpi 120 . . . . . 6 (𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) ⊆ 𝑦)
32adantl 277 . . . . 5 ((EXMID𝑥𝑦) → (𝑥 ∪ (𝑦𝑥)) ⊆ 𝑦)
4 elun1 3396 . . . . . . . . . 10 (𝑧𝑥𝑧 ∈ (𝑥 ∪ (𝑦𝑥)))
54adantl 277 . . . . . . . . 9 (((EXMID𝑧𝑦) ∧ 𝑧𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦𝑥)))
6 simplr 533 . . . . . . . . . . 11 (((EXMID𝑧𝑦) ∧ ¬ 𝑧𝑥) → 𝑧𝑦)
7 simpr 110 . . . . . . . . . . 11 (((EXMID𝑧𝑦) ∧ ¬ 𝑧𝑥) → ¬ 𝑧𝑥)
86, 7eldifd 3230 . . . . . . . . . 10 (((EXMID𝑧𝑦) ∧ ¬ 𝑧𝑥) → 𝑧 ∈ (𝑦𝑥))
9 elun2 3397 . . . . . . . . . 10 (𝑧 ∈ (𝑦𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦𝑥)))
108, 9syl 14 . . . . . . . . 9 (((EXMID𝑧𝑦) ∧ ¬ 𝑧𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦𝑥)))
11 exmidexmid 4331 . . . . . . . . . . 11 (EXMIDDECID 𝑧𝑥)
12 exmiddc 848 . . . . . . . . . . 11 (DECID 𝑧𝑥 → (𝑧𝑥 ∨ ¬ 𝑧𝑥))
1311, 12syl 14 . . . . . . . . . 10 (EXMID → (𝑧𝑥 ∨ ¬ 𝑧𝑥))
1413adantr 276 . . . . . . . . 9 ((EXMID𝑧𝑦) → (𝑧𝑥 ∨ ¬ 𝑧𝑥))
155, 10, 14mpjaodan 810 . . . . . . . 8 ((EXMID𝑧𝑦) → 𝑧 ∈ (𝑥 ∪ (𝑦𝑥)))
1615ex 115 . . . . . . 7 (EXMID → (𝑧𝑦𝑧 ∈ (𝑥 ∪ (𝑦𝑥))))
1716ssrdv 3254 . . . . . 6 (EXMID𝑦 ⊆ (𝑥 ∪ (𝑦𝑥)))
1817adantr 276 . . . . 5 ((EXMID𝑥𝑦) → 𝑦 ⊆ (𝑥 ∪ (𝑦𝑥)))
193, 18eqssd 3265 . . . 4 ((EXMID𝑥𝑦) → (𝑥 ∪ (𝑦𝑥)) = 𝑦)
2019ex 115 . . 3 (EXMID → (𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦))
2120alrimivv 1928 . 2 (EXMID → ∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦))
22 vex 2824 . . . . . 6 𝑧 ∈ V
23 p0ex 4323 . . . . . 6 {∅} ∈ V
24 sseq12 3273 . . . . . . . 8 ((𝑥 = 𝑧𝑦 = {∅}) → (𝑥𝑦𝑧 ⊆ {∅}))
25 simpl 109 . . . . . . . . . 10 ((𝑥 = 𝑧𝑦 = {∅}) → 𝑥 = 𝑧)
26 simpr 110 . . . . . . . . . . 11 ((𝑥 = 𝑧𝑦 = {∅}) → 𝑦 = {∅})
2726, 25difeq12d 3348 . . . . . . . . . 10 ((𝑥 = 𝑧𝑦 = {∅}) → (𝑦𝑥) = ({∅} ∖ 𝑧))
2825, 27uneq12d 3384 . . . . . . . . 9 ((𝑥 = 𝑧𝑦 = {∅}) → (𝑥 ∪ (𝑦𝑥)) = (𝑧 ∪ ({∅} ∖ 𝑧)))
2928, 26eqeq12d 2253 . . . . . . . 8 ((𝑥 = 𝑧𝑦 = {∅}) → ((𝑥 ∪ (𝑦𝑥)) = 𝑦 ↔ (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅}))
3024, 29imbi12d 234 . . . . . . 7 ((𝑥 = 𝑧𝑦 = {∅}) → ((𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) ↔ (𝑧 ⊆ {∅} → (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅})))
3130spc2gv 2916 . . . . . 6 ((𝑧 ∈ V ∧ {∅} ∈ V) → (∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) → (𝑧 ⊆ {∅} → (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅})))
3222, 23, 31mp2an 430 . . . . 5 (∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) → (𝑧 ⊆ {∅} → (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅}))
33 0ex 4258 . . . . . . . 8 ∅ ∈ V
3433snid 3739 . . . . . . 7 ∅ ∈ {∅}
35 eleq2 2302 . . . . . . 7 ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) ↔ ∅ ∈ {∅}))
3634, 35mpbiri 168 . . . . . 6 ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → ∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)))
37 eldifn 3352 . . . . . . . 8 (∅ ∈ ({∅} ∖ 𝑧) → ¬ ∅ ∈ 𝑧)
3837orim2i 773 . . . . . . 7 ((∅ ∈ 𝑧 ∨ ∅ ∈ ({∅} ∖ 𝑧)) → (∅ ∈ 𝑧 ∨ ¬ ∅ ∈ 𝑧))
39 elun 3370 . . . . . . 7 (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) ↔ (∅ ∈ 𝑧 ∨ ∅ ∈ ({∅} ∖ 𝑧)))
40 df-dc 847 . . . . . . 7 (DECID ∅ ∈ 𝑧 ↔ (∅ ∈ 𝑧 ∨ ¬ ∅ ∈ 𝑧))
4138, 39, 403imtr4i 201 . . . . . 6 (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) → DECID ∅ ∈ 𝑧)
4236, 41syl 14 . . . . 5 ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → DECID ∅ ∈ 𝑧)
4332, 42syl6 33 . . . 4 (∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) → (𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
4443alrimiv 1927 . . 3 (∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) → ∀𝑧(𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
45 df-exmid 4330 . . 3 (EXMID ↔ ∀𝑧(𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
4644, 45sylibr 134 . 2 (∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦) → EXMID)
4721, 46impbii 126 1 (EXMID ↔ ∀𝑥𝑦(𝑥𝑦 → (𝑥 ∪ (𝑦𝑥)) = 𝑦))
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  Vcvv 2821  cdif 3217  cun 3218  wss 3220  c0 3520  {csn 3708  EXMIDwem 4329
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
This theorem depends on definitions:  df-bi 117  df-dc 847  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-exmid 4330
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator