MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfac5lem3 Structured version   Unicode version

Theorem dfac5lem3 8497
Description: Lemma for dfac5 8500. (Contributed by NM, 12-Apr-2004.)
Hypothesis
Ref Expression
dfac5lem.1  |-  A  =  { u  |  ( u  =/=  (/)  /\  E. t  e.  h  u  =  ( { t }  X.  t ) ) }
Assertion
Ref Expression
dfac5lem3  |-  ( ( { w }  X.  w )  e.  A  <->  ( w  =/=  (/)  /\  w  e.  h ) )
Distinct variable groups:    w, u, t, h    w, A
Allowed substitution hints:    A( u, t, h)

Proof of Theorem dfac5lem3
StepHypRef Expression
1 snex 4678 . . . 4  |-  { w }  e.  _V
2 vex 3109 . . . 4  |-  w  e. 
_V
31, 2xpex 6577 . . 3  |-  ( { w }  X.  w
)  e.  _V
4 neeq1 2735 . . . 4  |-  ( u  =  ( { w }  X.  w )  -> 
( u  =/=  (/)  <->  ( {
w }  X.  w
)  =/=  (/) ) )
5 eqeq1 2458 . . . . 5  |-  ( u  =  ( { w }  X.  w )  -> 
( u  =  ( { t }  X.  t )  <->  ( {
w }  X.  w
)  =  ( { t }  X.  t
) ) )
65rexbidv 2965 . . . 4  |-  ( u  =  ( { w }  X.  w )  -> 
( E. t  e.  h  u  =  ( { t }  X.  t )  <->  E. t  e.  h  ( {
w }  X.  w
)  =  ( { t }  X.  t
) ) )
74, 6anbi12d 708 . . 3  |-  ( u  =  ( { w }  X.  w )  -> 
( ( u  =/=  (/)  /\  E. t  e.  h  u  =  ( { t }  X.  t ) )  <->  ( ( { w }  X.  w )  =/=  (/)  /\  E. t  e.  h  ( { w }  X.  w )  =  ( { t }  X.  t ) ) ) )
83, 7elab 3243 . 2  |-  ( ( { w }  X.  w )  e.  {
u  |  ( u  =/=  (/)  /\  E. t  e.  h  u  =  ( { t }  X.  t ) ) }  <-> 
( ( { w }  X.  w )  =/=  (/)  /\  E. t  e.  h  ( { w }  X.  w )  =  ( { t }  X.  t ) ) )
9 dfac5lem.1 . . 3  |-  A  =  { u  |  ( u  =/=  (/)  /\  E. t  e.  h  u  =  ( { t }  X.  t ) ) }
109eleq2i 2532 . 2  |-  ( ( { w }  X.  w )  e.  A  <->  ( { w }  X.  w )  e.  {
u  |  ( u  =/=  (/)  /\  E. t  e.  h  u  =  ( { t }  X.  t ) ) } )
11 xpeq2 5003 . . . . . 6  |-  ( w  =  (/)  ->  ( { w }  X.  w
)  =  ( { w }  X.  (/) ) )
12 xp0 5410 . . . . . 6  |-  ( { w }  X.  (/) )  =  (/)
1311, 12syl6eq 2511 . . . . 5  |-  ( w  =  (/)  ->  ( { w }  X.  w
)  =  (/) )
14 rneq 5217 . . . . . 6  |-  ( ( { w }  X.  w )  =  (/)  ->  ran  ( { w }  X.  w )  =  ran  (/) )
152snnz 4134 . . . . . . 7  |-  { w }  =/=  (/)
16 rnxp 5422 . . . . . . 7  |-  ( { w }  =/=  (/)  ->  ran  ( { w }  X.  w )  =  w )
1715, 16ax-mp 5 . . . . . 6  |-  ran  ( { w }  X.  w )  =  w
18 rn0 5243 . . . . . 6  |-  ran  (/)  =  (/)
1914, 17, 183eqtr3g 2518 . . . . 5  |-  ( ( { w }  X.  w )  =  (/)  ->  w  =  (/) )
2013, 19impbii 188 . . . 4  |-  ( w  =  (/)  <->  ( { w }  X.  w )  =  (/) )
2120necon3bii 2722 . . 3  |-  ( w  =/=  (/)  <->  ( { w }  X.  w )  =/=  (/) )
22 df-rex 2810 . . . 4  |-  ( E. t  e.  h  ( { w }  X.  w )  =  ( { t }  X.  t )  <->  E. t
( t  e.  h  /\  ( { w }  X.  w )  =  ( { t }  X.  t ) ) )
23 rneq 5217 . . . . . . . . . 10  |-  ( ( { w }  X.  w )  =  ( { t }  X.  t )  ->  ran  ( { w }  X.  w )  =  ran  ( { t }  X.  t ) )
24 vex 3109 . . . . . . . . . . . 12  |-  t  e. 
_V
2524snnz 4134 . . . . . . . . . . 11  |-  { t }  =/=  (/)
26 rnxp 5422 . . . . . . . . . . 11  |-  ( { t }  =/=  (/)  ->  ran  ( { t }  X.  t )  =  t )
2725, 26ax-mp 5 . . . . . . . . . 10  |-  ran  ( { t }  X.  t )  =  t
2823, 17, 273eqtr3g 2518 . . . . . . . . 9  |-  ( ( { w }  X.  w )  =  ( { t }  X.  t )  ->  w  =  t )
29 sneq 4026 . . . . . . . . . . 11  |-  ( w  =  t  ->  { w }  =  { t } )
3029xpeq1d 5011 . . . . . . . . . 10  |-  ( w  =  t  ->  ( { w }  X.  w )  =  ( { t }  X.  w ) )
31 xpeq2 5003 . . . . . . . . . 10  |-  ( w  =  t  ->  ( { t }  X.  w )  =  ( { t }  X.  t ) )
3230, 31eqtrd 2495 . . . . . . . . 9  |-  ( w  =  t  ->  ( { w }  X.  w )  =  ( { t }  X.  t ) )
3328, 32impbii 188 . . . . . . . 8  |-  ( ( { w }  X.  w )  =  ( { t }  X.  t )  <->  w  =  t )
34 equcom 1799 . . . . . . . 8  |-  ( w  =  t  <->  t  =  w )
3533, 34bitri 249 . . . . . . 7  |-  ( ( { w }  X.  w )  =  ( { t }  X.  t )  <->  t  =  w )
3635anbi2i 692 . . . . . 6  |-  ( ( t  e.  h  /\  ( { w }  X.  w )  =  ( { t }  X.  t ) )  <->  ( t  e.  h  /\  t  =  w ) )
37 ancom 448 . . . . . 6  |-  ( ( t  e.  h  /\  t  =  w )  <->  ( t  =  w  /\  t  e.  h )
)
3836, 37bitri 249 . . . . 5  |-  ( ( t  e.  h  /\  ( { w }  X.  w )  =  ( { t }  X.  t ) )  <->  ( t  =  w  /\  t  e.  h ) )
3938exbii 1672 . . . 4  |-  ( E. t ( t  e.  h  /\  ( { w }  X.  w
)  =  ( { t }  X.  t
) )  <->  E. t
( t  =  w  /\  t  e.  h
) )
40 elequ1 1826 . . . . 5  |-  ( t  =  w  ->  (
t  e.  h  <->  w  e.  h ) )
412, 40ceqsexv 3143 . . . 4  |-  ( E. t ( t  =  w  /\  t  e.  h )  <->  w  e.  h )
4222, 39, 413bitrri 272 . . 3  |-  ( w  e.  h  <->  E. t  e.  h  ( {
w }  X.  w
)  =  ( { t }  X.  t
) )
4321, 42anbi12i 695 . 2  |-  ( ( w  =/=  (/)  /\  w  e.  h )  <->  ( ( { w }  X.  w )  =/=  (/)  /\  E. t  e.  h  ( { w }  X.  w )  =  ( { t }  X.  t ) ) )
448, 10, 433bitr4i 277 1  |-  ( ( { w }  X.  w )  e.  A  <->  ( w  =/=  (/)  /\  w  e.  h ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 367    = wceq 1398   E.wex 1617    e. wcel 1823   {cab 2439    =/= wne 2649   E.wrex 2805   (/)c0 3783   {csn 4016    X. cxp 4986   ran crn 4989
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-rab 2813  df-v 3108  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-op 4023  df-uni 4236  df-br 4440  df-opab 4498  df-xp 4994  df-rel 4995  df-cnv 4996  df-dm 4998  df-rn 4999
This theorem is referenced by:  dfac5lem5  8499
  Copyright terms: Public domain W3C validator