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

Theorem acexmidlemb 5644
Description: Lemma for acexmid 5651. (Contributed by Jim Kingdon, 6-Aug-2019.)
Hypotheses
Ref Expression
acexmidlem.a  |-  A  =  { x  e.  { (/)
,  { (/) } }  |  ( x  =  (/)  \/  ph ) }
acexmidlem.b  |-  B  =  { x  e.  { (/)
,  { (/) } }  |  ( x  =  { (/) }  \/  ph ) }
acexmidlem.c  |-  C  =  { A ,  B }
Assertion
Ref Expression
acexmidlemb  |-  ( (/)  e.  B  ->  ph )
Distinct variable groups:    x, A    x, B    x, C    ph, x

Proof of Theorem acexmidlemb
StepHypRef Expression
1 acexmidlem.b . . . 4  |-  B  =  { x  e.  { (/)
,  { (/) } }  |  ( x  =  { (/) }  \/  ph ) }
21eleq2i 2154 . . 3  |-  ( (/)  e.  B  <->  (/)  e.  { x  e.  { (/) ,  { (/) } }  |  ( x  =  { (/) }  \/  ph ) } )
3 0ex 3966 . . . . 5  |-  (/)  e.  _V
43prid1 3548 . . . 4  |-  (/)  e.  { (/)
,  { (/) } }
5 eqeq1 2094 . . . . . 6  |-  ( x  =  (/)  ->  ( x  =  { (/) }  <->  (/)  =  { (/)
} ) )
65orbi1d 740 . . . . 5  |-  ( x  =  (/)  ->  ( ( x  =  { (/) }  \/  ph )  <->  ( (/)  =  { (/)
}  \/  ph )
) )
76elrab3 2772 . . . 4  |-  ( (/)  e.  { (/) ,  { (/) } }  ->  ( (/)  e.  {
x  e.  { (/) ,  { (/) } }  | 
( x  =  { (/)
}  \/  ph ) } 
<->  ( (/)  =  { (/)
}  \/  ph )
) )
84, 7ax-mp 7 . . 3  |-  ( (/)  e.  { x  e.  { (/)
,  { (/) } }  |  ( x  =  { (/) }  \/  ph ) }  <->  ( (/)  =  { (/)
}  \/  ph )
)
92, 8bitri 182 . 2  |-  ( (/)  e.  B  <->  ( (/)  =  { (/)
}  \/  ph )
)
10 noel 3290 . . . 4  |-  -.  (/)  e.  (/)
113snid 3475 . . . . 5  |-  (/)  e.  { (/)
}
12 eleq2 2151 . . . . 5  |-  ( (/)  =  { (/) }  ->  ( (/) 
e.  (/)  <->  (/)  e.  { (/) } ) )
1311, 12mpbiri 166 . . . 4  |-  ( (/)  =  { (/) }  ->  (/)  e.  (/) )
1410, 13mto 623 . . 3  |-  -.  (/)  =  { (/)
}
15 orel1 679 . . 3  |-  ( -.  (/)  =  { (/) }  ->  ( ( (/)  =  { (/)
}  \/  ph )  ->  ph ) )
1614, 15ax-mp 7 . 2  |-  ( (
(/)  =  { (/) }  \/  ph )  ->  ph )
179, 16sylbi 119 1  |-  ( (/)  e.  B  ->  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 103    \/ wo 664    = wceq 1289    e. wcel 1438   {crab 2363   (/)c0 3286   {csn 3446   {cpr 3447
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-nul 3965
This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-rab 2368  df-v 2621  df-dif 3001  df-un 3003  df-nul 3287  df-sn 3452  df-pr 3453
This theorem is referenced by:  acexmidlem1  5648
  Copyright terms: Public domain W3C validator