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

Theorem undifexmid 4172
Description: Union of complementary parts producing the whole and excluded middle. Although special cases such as undifss 3489 and undifdcss 6888 are provable, the full statement implies excluded middle as shown here. (Contributed by Jim Kingdon, 16-Jun-2022.)
Hypothesis
Ref Expression
undifexmid.1  |-  ( x 
C_  y  <->  ( x  u.  ( y  \  x
) )  =  y )
Assertion
Ref Expression
undifexmid  |-  ( ph  \/  -.  ph )
Distinct variable group:    ph, x, y

Proof of Theorem undifexmid
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 0ex 4109 . . . . 5  |-  (/)  e.  _V
21snid 3607 . . . 4  |-  (/)  e.  { (/)
}
3 ssrab2 3227 . . . . 5  |-  { z  e.  { (/) }  |  ph }  C_  { (/) }
4 p0ex 4167 . . . . . . 7  |-  { (/) }  e.  _V
54rabex 4126 . . . . . 6  |-  { z  e.  { (/) }  |  ph }  e.  _V
6 sseq12 3167 . . . . . . 7  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( x  C_  y  <->  { z  e.  { (/) }  |  ph }  C_  {
(/) } ) )
7 simpl 108 . . . . . . . . 9  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  ->  x  =  { z  e.  { (/) }  |  ph } )
8 simpr 109 . . . . . . . . . 10  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
y  =  { (/) } )
98, 7difeq12d 3241 . . . . . . . . 9  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( y  \  x
)  =  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )
107, 9uneq12d 3277 . . . . . . . 8  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( x  u.  (
y  \  x )
)  =  ( { z  e.  { (/) }  |  ph }  u.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) ) )
1110, 8eqeq12d 2180 . . . . . . 7  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( ( x  u.  ( y  \  x
) )  =  y  <-> 
( { z  e. 
{ (/) }  |  ph }  u.  ( { (/)
}  \  { z  e.  { (/) }  |  ph } ) )  =  { (/) } ) )
126, 11bibi12d 234 . . . . . 6  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( ( x  C_  y 
<->  ( x  u.  (
y  \  x )
)  =  y )  <-> 
( { z  e. 
{ (/) }  |  ph }  C_  { (/) }  <->  ( {
z  e.  { (/) }  |  ph }  u.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) )  =  { (/) } ) ) )
13 undifexmid.1 . . . . . 6  |-  ( x 
C_  y  <->  ( x  u.  ( y  \  x
) )  =  y )
145, 4, 12, 13vtocl2 2781 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  C_  {
(/) }  <->  ( { z  e.  { (/) }  |  ph }  u.  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )  =  { (/) } )
153, 14mpbi 144 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  u.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) )  =  { (/) }
162, 15eleqtrri 2242 . . 3  |-  (/)  e.  ( { z  e.  { (/)
}  |  ph }  u.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
) )
17 elun 3263 . . 3  |-  ( (/)  e.  ( { z  e. 
{ (/) }  |  ph }  u.  ( { (/)
}  \  { z  e.  { (/) }  |  ph } ) )  <->  ( (/)  e.  {
z  e.  { (/) }  |  ph }  \/  (/) 
e.  ( { (/) } 
\  { z  e. 
{ (/) }  |  ph } ) ) )
1816, 17mpbi 144 . 2  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  \/  (/)  e.  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )
19 biidd 171 . . . . . 6  |-  ( z  =  (/)  ->  ( ph  <->  ph ) )
2019elrab3 2883 . . . . 5  |-  ( (/)  e.  { (/) }  ->  ( (/) 
e.  { z  e. 
{ (/) }  |  ph } 
<-> 
ph ) )
212, 20ax-mp 5 . . . 4  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  <->  ph )
2221biimpi 119 . . 3  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  ->  ph )
23 eldifn 3245 . . . 4  |-  ( (/)  e.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
)  ->  -.  (/)  e.  {
z  e.  { (/) }  |  ph } )
2423, 21sylnib 666 . . 3  |-  ( (/)  e.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
)  ->  -.  ph )
2522, 24orim12i 749 . 2  |-  ( (
(/)  e.  { z  e.  { (/) }  |  ph }  \/  (/)  e.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) )  ->  ( ph  \/  -.  ph ) )
2618, 25ax-mp 5 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 103    <-> wb 104    \/ wo 698    = wceq 1343    e. wcel 2136   {crab 2448    \ cdif 3113    u. cun 3114    C_ wss 3116   (/)c0 3409   {csn 3576
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-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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator