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

Theorem nllyeq 21274
Description: Equality theorem for the Locally  A predicate. (Contributed by Mario Carneiro, 2-Mar-2015.)
Assertion
Ref Expression
nllyeq  |-  ( A  =  B  -> 𝑛Locally  A  = 𝑛Locally  B
)

Proof of Theorem nllyeq
Dummy variables  j  u  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq2 2690 . . . . 5  |-  ( A  =  B  ->  (
( jt  u )  e.  A  <->  ( jt  u )  e.  B
) )
21rexbidv 3052 . . . 4  |-  ( A  =  B  ->  ( E. u  e.  (
( ( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  A  <->  E. u  e.  ( ( ( nei `  j ) `  {
y } )  i^i 
~P x ) ( jt  u )  e.  B
) )
322ralbidv 2989 . . 3  |-  ( A  =  B  ->  ( A. x  e.  j  A. y  e.  x  E. u  e.  (
( ( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  A  <->  A. x  e.  j  A. y  e.  x  E. u  e.  ( ( ( nei `  j ) `  {
y } )  i^i 
~P x ) ( jt  u )  e.  B
) )
43rabbidv 3189 . 2  |-  ( A  =  B  ->  { j  e.  Top  |  A. x  e.  j  A. y  e.  x  E. u  e.  ( (
( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  A }  =  { j  e.  Top  | 
A. x  e.  j 
A. y  e.  x  E. u  e.  (
( ( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  B }
)
5 df-nlly 21270 . 2  |- 𝑛Locally  A  =  { j  e.  Top  | 
A. x  e.  j 
A. y  e.  x  E. u  e.  (
( ( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  A }
6 df-nlly 21270 . 2  |- 𝑛Locally  B  =  { j  e.  Top  | 
A. x  e.  j 
A. y  e.  x  E. u  e.  (
( ( nei `  j
) `  { y } )  i^i  ~P x ) ( jt  u )  e.  B }
74, 5, 63eqtr4g 2681 1  |-  ( A  =  B  -> 𝑛Locally  A  = 𝑛Locally  B
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1483    e. wcel 1990   A.wral 2912   E.wrex 2913   {crab 2916    i^i cin 3573   ~Pcpw 4158   {csn 4177   ` cfv 5888  (class class class)co 6650   ↾t crest 16081   Topctop 20698   neicnei 20901  𝑛Locally cnlly 21268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-ral 2917  df-rex 2918  df-rab 2921  df-nlly 21270
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator