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

Theorem undifexmid 4325
Description: Union of complementary parts producing the whole and excluded middle. Although special cases such as undifss 3605 and undifdcss 7220 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 4255 . . . . 5  |-  (/)  e.  _V
21snid 3736 . . . 4  |-  (/)  e.  { (/)
}
3 ssrab2 3333 . . . . 5  |-  { z  e.  { (/) }  |  ph }  C_  { (/) }
4 p0ex 4320 . . . . . . 7  |-  { (/) }  e.  _V
54rabex 4275 . . . . . 6  |-  { z  e.  { (/) }  |  ph }  e.  _V
6 sseq12 3273 . . . . . . 7  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( x  C_  y  <->  { z  e.  { (/) }  |  ph }  C_  {
(/) } ) )
7 simpl 109 . . . . . . . . 9  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  ->  x  =  { z  e.  { (/) }  |  ph } )
8 simpr 110 . . . . . . . . . 10  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
y  =  { (/) } )
98, 7difeq12d 3348 . . . . . . . . 9  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( y  \  x
)  =  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )
107, 9uneq12d 3384 . . . . . . . 8  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( x  u.  (
y  \  x )
)  =  ( { z  e.  { (/) }  |  ph }  u.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) ) )
1110, 8eqeq12d 2253 . . . . . . 7  |-  ( ( x  =  { z  e.  { (/) }  |  ph }  /\  y  =  { (/) } )  -> 
( ( x  u.  ( y  \  x
) )  =  y  <-> 
( { z  e. 
{ (/) }  |  ph }  u.  ( { (/)
}  \  { z  e.  { (/) }  |  ph } ) )  =  { (/) } ) )
126, 11bibi12d 235 . . . . . 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 2878 . . . . 5  |-  ( { z  e.  { (/) }  |  ph }  C_  {
(/) }  <->  ( { z  e.  { (/) }  |  ph }  u.  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )  =  { (/) } )
153, 14mpbi 145 . . . 4  |-  ( { z  e.  { (/) }  |  ph }  u.  ( { (/) }  \  {
z  e.  { (/) }  |  ph } ) )  =  { (/) }
162, 15eleqtrri 2314 . . 3  |-  (/)  e.  ( { z  e.  { (/)
}  |  ph }  u.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
) )
17 elun 3370 . . 3  |-  ( (/)  e.  ( { z  e. 
{ (/) }  |  ph }  u.  ( { (/)
}  \  { z  e.  { (/) }  |  ph } ) )  <->  ( (/)  e.  {
z  e.  { (/) }  |  ph }  \/  (/) 
e.  ( { (/) } 
\  { z  e. 
{ (/) }  |  ph } ) ) )
1816, 17mpbi 145 . 2  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  \/  (/)  e.  ( {
(/) }  \  { z  e.  { (/) }  |  ph } ) )
19 biidd 172 . . . . . 6  |-  ( z  =  (/)  ->  ( ph  <->  ph ) )
2019elrab3 2983 . . . . 5  |-  ( (/)  e.  { (/) }  ->  ( (/) 
e.  { z  e. 
{ (/) }  |  ph } 
<-> 
ph ) )
212, 20ax-mp 5 . . . 4  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  <->  ph )
2221biimpi 120 . . 3  |-  ( (/)  e.  { z  e.  { (/)
}  |  ph }  ->  ph )
23 eldifn 3352 . . . 4  |-  ( (/)  e.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
)  ->  -.  (/)  e.  {
z  e.  { (/) }  |  ph } )
2423, 21sylnib 687 . . 3  |-  ( (/)  e.  ( { (/) }  \  { z  e.  { (/)
}  |  ph }
)  ->  -.  ph )
2522, 24orim12i 771 . 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 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   {crab 2532    \ cdif 3217    u. cun 3218    C_ wss 3220   (/)c0 3520   {csn 3705
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 4244  ax-nul 4254  ax-pow 4306
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator