Theorem exmidundif 4185

Description: Excluded middle is equivalent to every subset having a complement. That is, the union of a subset and its relative complement being the whole set. Although special cases such as undifss 3489 and undifdcss 6888 are provable, the full statement is equivalent to excluded middle as shown here. (Contributed by Jim Kingdon, 18-Jun-2022.)

Assertion

Ref	Expression
exmidundif	⊢ (EXMID ↔ ∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦))

Distinct variable group:   𝑥,𝑦

Proof of Theorem exmidundif

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		undifss 3489	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) ⊆ 𝑦)
2	1	biimpi 119	. . . . . . 7 ⊢ (𝑥 ⊆ 𝑦 → (𝑥 ∪ (𝑦 ∖ 𝑥)) ⊆ 𝑦)
3	2	adantl 275	. . . . . 6 ⊢ ((EXMID ∧ 𝑥 ⊆ 𝑦) → (𝑥 ∪ (𝑦 ∖ 𝑥)) ⊆ 𝑦)
4		elun1 3289	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑥 → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥)))
5	4	adantl 275	. . . . . . . . . 10 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ 𝑧 ∈ 𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥)))
6		simplr 520	. . . . . . . . . . . 12 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ ¬ 𝑧 ∈ 𝑥) → 𝑧 ∈ 𝑦)
7		simpr 109	. . . . . . . . . . . 12 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ ¬ 𝑧 ∈ 𝑥) → ¬ 𝑧 ∈ 𝑥)
8	6, 7	eldifd 3126	. . . . . . . . . . 11 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ ¬ 𝑧 ∈ 𝑥) → 𝑧 ∈ (𝑦 ∖ 𝑥))
9		elun2 3290	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑦 ∖ 𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥)))
10	8, 9	syl 14	. . . . . . . . . 10 ⊢ (((EXMID ∧ 𝑧 ∈ 𝑦) ∧ ¬ 𝑧 ∈ 𝑥) → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥)))
11		exmidexmid 4175	. . . . . . . . . . . 12 ⊢ (EXMID → DECID 𝑧 ∈ 𝑥)
12		exmiddc 826	. . . . . . . . . . . 12 ⊢ (DECID 𝑧 ∈ 𝑥 → (𝑧 ∈ 𝑥 ∨ ¬ 𝑧 ∈ 𝑥))
13	11, 12	syl 14	. . . . . . . . . . 11 ⊢ (EXMID → (𝑧 ∈ 𝑥 ∨ ¬ 𝑧 ∈ 𝑥))
14	13	adantr 274	. . . . . . . . . 10 ⊢ ((EXMID ∧ 𝑧 ∈ 𝑦) → (𝑧 ∈ 𝑥 ∨ ¬ 𝑧 ∈ 𝑥))
15	5, 10, 14	mpjaodan 788	. . . . . . . . 9 ⊢ ((EXMID ∧ 𝑧 ∈ 𝑦) → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥)))
16	15	ex 114	. . . . . . . 8 ⊢ (EXMID → (𝑧 ∈ 𝑦 → 𝑧 ∈ (𝑥 ∪ (𝑦 ∖ 𝑥))))
17	16	ssrdv 3148	. . . . . . 7 ⊢ (EXMID → 𝑦 ⊆ (𝑥 ∪ (𝑦 ∖ 𝑥)))
18	17	adantr 274	. . . . . 6 ⊢ ((EXMID ∧ 𝑥 ⊆ 𝑦) → 𝑦 ⊆ (𝑥 ∪ (𝑦 ∖ 𝑥)))
19	3, 18	eqssd 3159	. . . . 5 ⊢ ((EXMID ∧ 𝑥 ⊆ 𝑦) → (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦)
20	19	ex 114	. . . 4 ⊢ (EXMID → (𝑥 ⊆ 𝑦 → (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦))
21		ssun1 3285	. . . . 5 ⊢ 𝑥 ⊆ (𝑥 ∪ (𝑦 ∖ 𝑥))
22		sseq2 3166	. . . . 5 ⊢ ((𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦 → (𝑥 ⊆ (𝑥 ∪ (𝑦 ∖ 𝑥)) ↔ 𝑥 ⊆ 𝑦))
23	21, 22	mpbii 147	. . . 4 ⊢ ((𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦 → 𝑥 ⊆ 𝑦)
24	20, 23	impbid1 141	. . 3 ⊢ (EXMID → (𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦))
25	24	alrimivv 1863	. 2 ⊢ (EXMID → ∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦))
26		vex 2729	. . . . . 6 ⊢ 𝑧 ∈ V
27		p0ex 4167	. . . . . 6 ⊢ {∅} ∈ V
28		sseq12 3167	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → (𝑥 ⊆ 𝑦 ↔ 𝑧 ⊆ {∅}))
29		simpl 108	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → 𝑥 = 𝑧)
30		simpr 109	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → 𝑦 = {∅})
31	30, 29	difeq12d 3241	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → (𝑦 ∖ 𝑥) = ({∅} ∖ 𝑧))
32	29, 31	uneq12d 3277	. . . . . . . . 9 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → (𝑥 ∪ (𝑦 ∖ 𝑥)) = (𝑧 ∪ ({∅} ∖ 𝑧)))
33	32, 30	eqeq12d 2180	. . . . . . . 8 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → ((𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦 ↔ (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅}))
34	28, 33	bibi12d 234	. . . . . . 7 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = {∅}) → ((𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) ↔ (𝑧 ⊆ {∅} ↔ (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅})))
35	34	spc2gv 2817	. . . . . 6 ⊢ ((𝑧 ∈ V ∧ {∅} ∈ V) → (∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) → (𝑧 ⊆ {∅} ↔ (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅})))
36	26, 27, 35	mp2an 423	. . . . 5 ⊢ (∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) → (𝑧 ⊆ {∅} ↔ (𝑧 ∪ ({∅} ∖ 𝑧)) = {∅}))
37		0ex 4109	. . . . . . . 8 ⊢ ∅ ∈ V
38	37	snid 3607	. . . . . . 7 ⊢ ∅ ∈ {∅}
39		eleq2 2230	. . . . . . 7 ⊢ ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) ↔ ∅ ∈ {∅}))
40	38, 39	mpbiri 167	. . . . . 6 ⊢ ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → ∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)))
41		eldifn 3245	. . . . . . . 8 ⊢ (∅ ∈ ({∅} ∖ 𝑧) → ¬ ∅ ∈ 𝑧)
42	41	orim2i 751	. . . . . . 7 ⊢ ((∅ ∈ 𝑧 ∨ ∅ ∈ ({∅} ∖ 𝑧)) → (∅ ∈ 𝑧 ∨ ¬ ∅ ∈ 𝑧))
43		elun 3263	. . . . . . 7 ⊢ (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) ↔ (∅ ∈ 𝑧 ∨ ∅ ∈ ({∅} ∖ 𝑧)))
44		df-dc 825	. . . . . . 7 ⊢ (DECID ∅ ∈ 𝑧 ↔ (∅ ∈ 𝑧 ∨ ¬ ∅ ∈ 𝑧))
45	42, 43, 44	3imtr4i 200	. . . . . 6 ⊢ (∅ ∈ (𝑧 ∪ ({∅} ∖ 𝑧)) → DECID ∅ ∈ 𝑧)
46	40, 45	syl 14	. . . . 5 ⊢ ((𝑧 ∪ ({∅} ∖ 𝑧)) = {∅} → DECID ∅ ∈ 𝑧)
47	36, 46	syl6bi 162	. . . 4 ⊢ (∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) → (𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
48	47	alrimiv 1862	. . 3 ⊢ (∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) → ∀𝑧(𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
49		df-exmid 4174	. . 3 ⊢ (EXMID ↔ ∀𝑧(𝑧 ⊆ {∅} → DECID ∅ ∈ 𝑧))
50	48, 49	sylibr 133	. 2 ⊢ (∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦) → EXMID)
51	25, 50	impbii 125	1 ⊢ (EXMID ↔ ∀𝑥∀𝑦(𝑥 ⊆ 𝑦 ↔ (𝑥 ∪ (𝑦 ∖ 𝑥)) = 𝑦))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698  DECID wdc 824  ∀wal 1341   = wceq 1343   ∈ wcel 2136  Vcvv 2726   ∖ cdif 3113   ∪ cun 3114   ⊆ wss 3116  ∅c0 3409  {csn 3576  EXMIDwem 4173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153

This theorem depends on definitions:  df-bi 116  df-dc 825  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-exmid 4174

This theorem is referenced by: (None)