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

Theorem unfiexmid 7036
Description: If the union of any two finite sets is finite, excluded middle follows. Remark 8.1.17 of [AczelRathjen], p. 74. (Contributed by Mario Carneiro and Jim Kingdon, 5-Mar-2022.)
Hypothesis
Ref Expression
unfiexmid.1 ((𝑥 ∈ Fin ∧ 𝑦 ∈ Fin) → (𝑥𝑦) ∈ Fin)
Assertion
Ref Expression
unfiexmid (𝜑 ∨ ¬ 𝜑)
Distinct variable group:   𝜑,𝑥,𝑦

Proof of Theorem unfiexmid
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-pr 3645 . . . . 5 {{𝑧 ∈ 1o𝜑}, 1o} = ({{𝑧 ∈ 1o𝜑}} ∪ {1o})
2 unfiexmid.1 . . . . . . 7 ((𝑥 ∈ Fin ∧ 𝑦 ∈ Fin) → (𝑥𝑦) ∈ Fin)
32rgen2a 2561 . . . . . 6 𝑥 ∈ Fin ∀𝑦 ∈ Fin (𝑥𝑦) ∈ Fin
4 df1o2 6533 . . . . . . . . . 10 1o = {∅}
5 rabeq 2765 . . . . . . . . . 10 (1o = {∅} → {𝑧 ∈ 1o𝜑} = {𝑧 ∈ {∅} ∣ 𝜑})
64, 5ax-mp 5 . . . . . . . . 9 {𝑧 ∈ 1o𝜑} = {𝑧 ∈ {∅} ∣ 𝜑}
7 ordtriexmidlem 4580 . . . . . . . . 9 {𝑧 ∈ {∅} ∣ 𝜑} ∈ On
86, 7eqeltri 2279 . . . . . . . 8 {𝑧 ∈ 1o𝜑} ∈ On
9 snfig 6925 . . . . . . . 8 ({𝑧 ∈ 1o𝜑} ∈ On → {{𝑧 ∈ 1o𝜑}} ∈ Fin)
108, 9ax-mp 5 . . . . . . 7 {{𝑧 ∈ 1o𝜑}} ∈ Fin
11 1onn 6624 . . . . . . . 8 1o ∈ ω
12 snfig 6925 . . . . . . . 8 (1o ∈ ω → {1o} ∈ Fin)
1311, 12ax-mp 5 . . . . . . 7 {1o} ∈ Fin
14 uneq1 3324 . . . . . . . . 9 (𝑥 = {{𝑧 ∈ 1o𝜑}} → (𝑥𝑦) = ({{𝑧 ∈ 1o𝜑}} ∪ 𝑦))
1514eleq1d 2275 . . . . . . . 8 (𝑥 = {{𝑧 ∈ 1o𝜑}} → ((𝑥𝑦) ∈ Fin ↔ ({{𝑧 ∈ 1o𝜑}} ∪ 𝑦) ∈ Fin))
16 uneq2 3325 . . . . . . . . 9 (𝑦 = {1o} → ({{𝑧 ∈ 1o𝜑}} ∪ 𝑦) = ({{𝑧 ∈ 1o𝜑}} ∪ {1o}))
1716eleq1d 2275 . . . . . . . 8 (𝑦 = {1o} → (({{𝑧 ∈ 1o𝜑}} ∪ 𝑦) ∈ Fin ↔ ({{𝑧 ∈ 1o𝜑}} ∪ {1o}) ∈ Fin))
1815, 17rspc2v 2894 . . . . . . 7 (({{𝑧 ∈ 1o𝜑}} ∈ Fin ∧ {1o} ∈ Fin) → (∀𝑥 ∈ Fin ∀𝑦 ∈ Fin (𝑥𝑦) ∈ Fin → ({{𝑧 ∈ 1o𝜑}} ∪ {1o}) ∈ Fin))
1910, 13, 18mp2an 426 . . . . . 6 (∀𝑥 ∈ Fin ∀𝑦 ∈ Fin (𝑥𝑦) ∈ Fin → ({{𝑧 ∈ 1o𝜑}} ∪ {1o}) ∈ Fin)
203, 19ax-mp 5 . . . . 5 ({{𝑧 ∈ 1o𝜑}} ∪ {1o}) ∈ Fin
211, 20eqeltri 2279 . . . 4 {{𝑧 ∈ 1o𝜑}, 1o} ∈ Fin
228elexi 2786 . . . . 5 {𝑧 ∈ 1o𝜑} ∈ V
2322prid1 3744 . . . 4 {𝑧 ∈ 1o𝜑} ∈ {{𝑧 ∈ 1o𝜑}, 1o}
2411elexi 2786 . . . . 5 1o ∈ V
2524prid2 3745 . . . 4 1o ∈ {{𝑧 ∈ 1o𝜑}, 1o}
26 fidceq 6987 . . . 4 (({{𝑧 ∈ 1o𝜑}, 1o} ∈ Fin ∧ {𝑧 ∈ 1o𝜑} ∈ {{𝑧 ∈ 1o𝜑}, 1o} ∧ 1o ∈ {{𝑧 ∈ 1o𝜑}, 1o}) → DECID {𝑧 ∈ 1o𝜑} = 1o)
2721, 23, 25, 26mp3an 1350 . . 3 DECID {𝑧 ∈ 1o𝜑} = 1o
28 exmiddc 838 . . 3 (DECID {𝑧 ∈ 1o𝜑} = 1o → ({𝑧 ∈ 1o𝜑} = 1o ∨ ¬ {𝑧 ∈ 1o𝜑} = 1o))
2927, 28ax-mp 5 . 2 ({𝑧 ∈ 1o𝜑} = 1o ∨ ¬ {𝑧 ∈ 1o𝜑} = 1o)
304eqeq2i 2217 . . . 4 ({𝑧 ∈ 1o𝜑} = 1o ↔ {𝑧 ∈ 1o𝜑} = {∅})
31 0ex 4182 . . . . 5 ∅ ∈ V
32 biidd 172 . . . . 5 (𝑧 = ∅ → (𝜑𝜑))
3331, 32rabsnt 3713 . . . 4 ({𝑧 ∈ 1o𝜑} = {∅} → 𝜑)
3430, 33sylbi 121 . . 3 ({𝑧 ∈ 1o𝜑} = 1o𝜑)
35 df-rab 2494 . . . . 5 {𝑧 ∈ 1o𝜑} = {𝑧 ∣ (𝑧 ∈ 1o𝜑)}
36 iba 300 . . . . . 6 (𝜑 → (𝑧 ∈ 1o ↔ (𝑧 ∈ 1o𝜑)))
3736abbi2dv 2325 . . . . 5 (𝜑 → 1o = {𝑧 ∣ (𝑧 ∈ 1o𝜑)})
3835, 37eqtr4id 2258 . . . 4 (𝜑 → {𝑧 ∈ 1o𝜑} = 1o)
3938con3i 633 . . 3 (¬ {𝑧 ∈ 1o𝜑} = 1o → ¬ 𝜑)
4034, 39orim12i 761 . 2 (({𝑧 ∈ 1o𝜑} = 1o ∨ ¬ {𝑧 ∈ 1o𝜑} = 1o) → (𝜑 ∨ ¬ 𝜑))
4129, 40ax-mp 5 1 (𝜑 ∨ ¬ 𝜑)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wo 710  DECID wdc 836   = wceq 1373  wcel 2177  {cab 2192  wral 2485  {crab 2489  cun 3168  c0 3464  {csn 3638  {cpr 3639  Oncon0 4423  ωcom 4651  1oc1o 6513  Fincfn 6845
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4173  ax-nul 4181  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598  ax-iinf 4649
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3003  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-nul 3465  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-br 4055  df-opab 4117  df-tr 4154  df-id 4353  df-iord 4426  df-on 4428  df-suc 4431  df-iom 4652  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-1o 6520  df-en 6846  df-fin 6848
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator