Theorem acexmid 6078

Description: The axiom of choice implies excluded middle. Theorem 1.3 in [Bauer] p. 483.

The statement of the axiom of choice given here is ac2 in the Metamath Proof Explorer (version of 3-Aug-2019). In particular, note that the choice function 𝑦 provides a value when 𝑧 is inhabited (as opposed to nonempty as in some statements of the axiom of choice).

Essentially the same proof can also be found at "The axiom of choice implies instances of EM", [Crosilla], p. "Set-theoretic principles incompatible with intuitionistic logic".

Often referred to as Diaconescu's theorem, or Diaconescu-Goodman-Myhill theorem, after Radu Diaconescu who discovered it in 1975 in the framework of topos theory and N. D. Goodman and John Myhill in 1978 in the framework of set theory (although it already appeared as an exercise in Errett Bishop's book Foundations of Constructive Analysis from 1967).

For this theorem stated using the df-ac 7556 and df-exmid 4330 syntaxes, see exmidac 7559. (Contributed by Jim Kingdon, 4-Aug-2019.)

Hypothesis

Ref	Expression
acexmid.choice	⊢ ∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)

Assertion

Ref	Expression
acexmid	⊢ (𝜑 ∨ ¬ 𝜑)

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤,𝑣,𝑢)

Proof of Theorem acexmid

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1581	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑣(𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒))
2	1	sb8eu 2099	. . . . . . . . . . . . 13 ⊢ (∃!𝑓(𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ ∃!𝑣[𝑣 / 𝑓](𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)))
3		eleq12 2303	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑓 = 𝑣 ∧ 𝑐 = 𝑧) → (𝑓 ∈ 𝑐 ↔ 𝑣 ∈ 𝑧))
4	3	ancoms 268	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑐 = 𝑧 ∧ 𝑓 = 𝑣) → (𝑓 ∈ 𝑐 ↔ 𝑣 ∈ 𝑧))
5	4	3adant3 1048	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) → (𝑓 ∈ 𝑐 ↔ 𝑣 ∈ 𝑧))
6		eleq12 2303	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑐 = 𝑧 ∧ 𝑒 = 𝑢) → (𝑐 ∈ 𝑒 ↔ 𝑧 ∈ 𝑢))
7	6	3ad2antl1 1190	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) ∧ 𝑒 = 𝑢) → (𝑐 ∈ 𝑒 ↔ 𝑧 ∈ 𝑢))
8		eleq12 2303	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑓 = 𝑣 ∧ 𝑒 = 𝑢) → (𝑓 ∈ 𝑒 ↔ 𝑣 ∈ 𝑢))
9	8	3ad2antl2 1191	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) ∧ 𝑒 = 𝑢) → (𝑓 ∈ 𝑒 ↔ 𝑣 ∈ 𝑢))
10	7, 9	anbi12d 477	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) ∧ 𝑒 = 𝑢) → ((𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
11		simpl3 1033	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) ∧ 𝑒 = 𝑢) → 𝑏 = 𝑦)
12	10, 11	cbvrexdva2 2794	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) → (∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
13	5, 12	anbi12d 477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 = 𝑧 ∧ 𝑓 = 𝑣 ∧ 𝑏 = 𝑦) → ((𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
14	13	3com23 1240	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦 ∧ 𝑓 = 𝑣) → ((𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
15	14	3expa 1234	. . . . . . . . . . . . . . 15 ⊢ (((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) ∧ 𝑓 = 𝑣) → ((𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
16	15	sbiedv 1842	. . . . . . . . . . . . . 14 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) → ([𝑣 / 𝑓](𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
17	16	eubidv 2094	. . . . . . . . . . . . 13 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) → (∃!𝑣[𝑣 / 𝑓](𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ ∃!𝑣(𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
18	2, 17	bitrid 192	. . . . . . . . . . . 12 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) → (∃!𝑓(𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)) ↔ ∃!𝑣(𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))))
19		df-reu 2535	. . . . . . . . . . . 12 ⊢ (∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∃!𝑓(𝑓 ∈ 𝑐 ∧ ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)))
20		df-reu 2535	. . . . . . . . . . . 12 ⊢ (∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃!𝑣(𝑣 ∈ 𝑧 ∧ ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
21	18, 19, 20	3bitr4g 223	. . . . . . . . . . 11 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) → (∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
22	21	adantr 276	. . . . . . . . . 10 ⊢ (((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) ∧ 𝑑 = 𝑤) → (∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
23		simpll 531	. . . . . . . . . 10 ⊢ (((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) ∧ 𝑑 = 𝑤) → 𝑐 = 𝑧)
24	22, 23	cbvraldva2 2793	. . . . . . . . 9 ⊢ ((𝑐 = 𝑧 ∧ 𝑏 = 𝑦) → (∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
25	24	ancoms 268	. . . . . . . 8 ⊢ ((𝑏 = 𝑦 ∧ 𝑐 = 𝑧) → (∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
26	25	adantll 480	. . . . . . 7 ⊢ (((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) ∧ 𝑐 = 𝑧) → (∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
27		simpll 531	. . . . . . 7 ⊢ (((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) ∧ 𝑐 = 𝑧) → 𝑎 = 𝑥)
28	26, 27	cbvraldva2 2793	. . . . . 6 ⊢ ((𝑎 = 𝑥 ∧ 𝑏 = 𝑦) → (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
29	28	cbvexdva 1985	. . . . 5 ⊢ (𝑎 = 𝑥 → (∃𝑏∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)))
30	29	cbvalv 1973	. . . 4 ⊢ (∀𝑎∃𝑏∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒) ↔ ∀𝑥∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢))
31		acexmid.choice	. . . 4 ⊢ ∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢)
32	30, 31	mpgbir 1506	. . 3 ⊢ ∀𝑎∃𝑏∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)
33	32	spi 1589	. 2 ⊢ ∃𝑏∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑐 ∃!𝑓 ∈ 𝑐 ∃𝑒 ∈ 𝑏 (𝑐 ∈ 𝑒 ∧ 𝑓 ∈ 𝑒)
34	33	acexmidlemv 6077	1 ⊢ (𝜑 ∨ ¬ 𝜑)

Syntax hints:  ¬ wn 3   ∧ wa 104   ↔ wb 105   ∨ wo 720   ∧ w3a 1009  ∀wal 1400  ∃wex 1545  [wsb 1815  ∃!weu 2086  ∀wral 2528  ∃wrex 2529  ∃!wreu 2530

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-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  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-uni 3934  df-tr 4228  df-iord 4509  df-on 4511  df-suc 4514  df-iota 5335  df-riota 6032

This theorem is referenced by: (None)