Theorem exmidsssnc 4247

Description: Excluded middle in terms of subsets of a singleton. This is similar to exmid01 4242 but lets you choose any set as the element of the singleton rather than just (/). It is similar to exmidsssn 4246 but for a particular set B rather than all sets. (Contributed by Jim Kingdon, 29-Jul-2023.)

Assertion

Ref	Expression
exmidsssnc	|- ( B e. V -> (EXMID <-> A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) ) )

Distinct variable groups:   x, B   x, V

Proof of Theorem exmidsssnc

Dummy variables u w y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		exmidsssn 4246	. . . 4 |- (EXMID <-> A. x A. u ( x C_ { u } <-> ( x = (/) \/ x = { u } ) ) )
2		sneq 3644	. . . . . . . 8 |- ( u = B -> { u } = { B } )
3	2	sseq2d 3223	. . . . . . 7 |- ( u = B -> ( x C_ { u } <-> x C_ { B } ) )
4	2	eqeq2d 2217	. . . . . . . 8 |- ( u = B -> ( x = { u } <-> x = { B } ) )
5	4	orbi2d 792	. . . . . . 7 |- ( u = B -> ( ( x = (/) \/ x = { u } ) <-> ( x = (/) \/ x = { B } ) ) )
6	3, 5	bibi12d 235	. . . . . 6 |- ( u = B -> ( ( x C_ { u } <-> ( x = (/) \/ x = { u } ) ) <-> ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) ) )
7	6	spcgv 2860	. . . . 5 |- ( B e. V -> ( A. u ( x C_ { u } <-> ( x = (/) \/ x = { u } ) ) -> ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) ) )
8	7	alimdv 1902	. . . 4 |- ( B e. V -> ( A. x A. u ( x C_ { u } <-> ( x = (/) \/ x = { u } ) ) -> A. x ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) ) )
9	1, 8	biimtrid 152	. . 3 |- ( B e. V -> (EXMID -> A. x ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) ) )
10		biimp 118	. . . 4 |- ( ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) -> ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) )
11	10	alimi 1478	. . 3 |- ( A. x ( x C_ { B } <-> ( x = (/) \/ x = { B } ) ) -> A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) )
12	9, 11	syl6 33	. 2 |- ( B e. V -> (EXMID -> A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) ) )
13		ssrab2 3278	. . . . . . . . 9 |- { z e. { B } | (/) e. y } C_ { B }
14		snexg 4228	. . . . . . . . . 10 |- ( B e. V -> { B } e. _V )
15		rabexg 4187	. . . . . . . . . 10 |- ( { B } e. _V -> { z e. { B } | (/) e. y } e. _V )
16		sseq1 3216	. . . . . . . . . . . 12 |- ( x = { z e. { B } | (/) e. y } -> ( x C_ { B } <-> { z e. { B } | (/) e. y } C_ { B } ) )
17		eqeq1 2212	. . . . . . . . . . . . 13 |- ( x = { z e. { B } | (/) e. y } -> ( x = (/) <-> { z e. { B } | (/) e. y } = (/) ) )
18		eqeq1 2212	. . . . . . . . . . . . 13 |- ( x = { z e. { B } | (/) e. y } -> ( x = { B } <-> { z e. { B } | (/) e. y } = { B } ) )
19	17, 18	orbi12d 795	. . . . . . . . . . . 12 |- ( x = { z e. { B } | (/) e. y } -> ( ( x = (/) \/ x = { B } ) <-> ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) ) )
20	16, 19	imbi12d 234	. . . . . . . . . . 11 |- ( x = { z e. { B } | (/) e. y } -> ( ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) <-> ( { z e. { B } | (/) e. y } C_ { B } -> ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) ) ) )
21	20	spcgv 2860	. . . . . . . . . 10 |- ( { z e. { B } | (/) e. y } e. _V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( { z e. { B } | (/) e. y } C_ { B } -> ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) ) ) )
22	14, 15, 21	3syl 17	. . . . . . . . 9 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( { z e. { B } | (/) e. y } C_ { B } -> ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) ) ) )
23	13, 22	mpii 44	. . . . . . . 8 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) ) )
24		rabeq0 3490	. . . . . . . . . . 11 |- ( { z e. { B } | (/) e. y } = (/) <-> A. z e. { B } -. (/) e. y )
25		snmg 3751	. . . . . . . . . . . 12 |- ( B e. V -> E. w w e. { B } )
26		r19.3rmv 3551	. . . . . . . . . . . 12 |- ( E. w w e. { B } -> ( -. (/) e. y <-> A. z e. { B } -. (/) e. y ) )
27	25, 26	syl 14	. . . . . . . . . . 11 |- ( B e. V -> ( -. (/) e. y <-> A. z e. { B } -. (/) e. y ) )
28	24, 27	bitr4id 199	. . . . . . . . . 10 |- ( B e. V -> ( { z e. { B } | (/) e. y } = (/) <-> -. (/) e. y ) )
29	28	biimpd 144	. . . . . . . . 9 |- ( B e. V -> ( { z e. { B } | (/) e. y } = (/) -> -. (/) e. y ) )
30		snidg 3662	. . . . . . . . . . . . 13 |- ( B e. V -> B e. { B } )
31	30	adantr 276	. . . . . . . . . . . 12 |- ( ( B e. V /\ { z e. { B } | (/) e. y } = { B } ) -> B e. { B } )
32		simpr 110	. . . . . . . . . . . 12 |- ( ( B e. V /\ { z e. { B } | (/) e. y } = { B } ) -> { z e. { B } | (/) e. y } = { B } )
33	31, 32	eleqtrrd 2285	. . . . . . . . . . 11 |- ( ( B e. V /\ { z e. { B } | (/) e. y } = { B } ) -> B e. { z e. { B } | (/) e. y } )
34		biidd 172	. . . . . . . . . . . . 13 |- ( z = B -> ( (/) e. y <-> (/) e. y ) )
35	34	elrab 2929	. . . . . . . . . . . 12 |- ( B e. { z e. { B } | (/) e. y } <-> ( B e. { B } /\ (/) e. y ) )
36	35	simprbi 275	. . . . . . . . . . 11 |- ( B e. { z e. { B } | (/) e. y } -> (/) e. y )
37	33, 36	syl 14	. . . . . . . . . 10 |- ( ( B e. V /\ { z e. { B } | (/) e. y } = { B } ) -> (/) e. y )
38	37	ex 115	. . . . . . . . 9 |- ( B e. V -> ( { z e. { B } | (/) e. y } = { B } -> (/) e. y ) )
39	29, 38	orim12d 788	. . . . . . . 8 |- ( B e. V -> ( ( { z e. { B } | (/) e. y } = (/) \/ { z e. { B } | (/) e. y } = { B } ) -> ( -. (/) e. y \/ (/) e. y ) ) )
40	23, 39	syld 45	. . . . . . 7 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( -. (/) e. y \/ (/) e. y ) ) )
41		orcom 730	. . . . . . 7 |- ( ( -. (/) e. y \/ (/) e. y ) <-> ( (/) e. y \/ -. (/) e. y ) )
42	40, 41	imbitrdi 161	. . . . . 6 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( (/) e. y \/ -. (/) e. y ) ) )
43		df-dc 837	. . . . . 6 |- (DECID (/) e. y <-> ( (/) e. y \/ -. (/) e. y ) )
44	42, 43	imbitrrdi 162	. . . . 5 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> DECID (/) e. y ) )
45	44	a1dd 48	. . . 4 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> ( y C_ { (/) } -> DECID (/) e. y ) ) )
46	45	alrimdv 1899	. . 3 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> A. y ( y C_ { (/) } -> DECID (/) e. y ) ) )
47		df-exmid 4239	. . 3 |- (EXMID <-> A. y ( y C_ { (/) } -> DECID (/) e. y ) )
48	46, 47	imbitrrdi 162	. 2 |- ( B e. V -> ( A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) -> EXMID ) )
49	12, 48	impbid 129	1 |- ( B e. V -> (EXMID <-> A. x ( x C_ { B } -> ( x = (/) \/ x = { B } ) ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 710  DECID wdc 836   A.wal 1371   = wceq 1373   E.wex 1515   e. wcel 2176   A.wral 2484   {crab 2488   _Vcvv 2772   C_ wss 3166   (/)c0 3460   {csn 3633  EXMIDwem 4238

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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-nul 4170  ax-pow 4218

This theorem depends on definitions:  df-bi 117  df-dc 837  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rab 2493  df-v 2774  df-dif 3168  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-exmid 4239

This theorem is referenced by:  exmidunben  12797