Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnwe2val Structured version   Unicode version

Theorem fnwe2val 27124
Description: Lemma for fnwe2 27128. Substitute variables. (Contributed by Stefan O'Rear, 19-Jan-2015.)
Hypotheses
Ref Expression
fnwe2.su  |-  ( z  =  ( F `  x )  ->  S  =  U )
fnwe2.t  |-  T  =  { <. x ,  y
>.  |  ( ( F `  x ) R ( F `  y )  \/  (
( F `  x
)  =  ( F `
 y )  /\  x U y ) ) }
Assertion
Ref Expression
fnwe2val  |-  ( a T b  <->  ( ( F `  a ) R ( F `  b )  \/  (
( F `  a
)  =  ( F `
 b )  /\  a [_ ( F `  a )  /  z ]_ S b ) ) )
Distinct variable groups:    y, U, z, a, b    x, S, y, a, b    x, R, y, a, b    x, z, F, y, a, b    T, a, b
Allowed substitution hints:    R( z)    S( z)    T( x, y, z)    U( x)

Proof of Theorem fnwe2val
StepHypRef Expression
1 vex 2959 . 2  |-  a  e. 
_V
2 vex 2959 . 2  |-  b  e. 
_V
3 fveq2 5728 . . . 4  |-  ( x  =  a  ->  ( F `  x )  =  ( F `  a ) )
4 fveq2 5728 . . . 4  |-  ( y  =  b  ->  ( F `  y )  =  ( F `  b ) )
53, 4breqan12d 4227 . . 3  |-  ( ( x  =  a  /\  y  =  b )  ->  ( ( F `  x ) R ( F `  y )  <-> 
( F `  a
) R ( F `
 b ) ) )
63, 4eqeqan12d 2451 . . . 4  |-  ( ( x  =  a  /\  y  =  b )  ->  ( ( F `  x )  =  ( F `  y )  <-> 
( F `  a
)  =  ( F `
 b ) ) )
7 simpl 444 . . . . 5  |-  ( ( x  =  a  /\  y  =  b )  ->  x  =  a )
8 fvex 5742 . . . . . . . 8  |-  ( F `
 x )  e. 
_V
9 nfcv 2572 . . . . . . . 8  |-  F/_ z U
10 fnwe2.su . . . . . . . 8  |-  ( z  =  ( F `  x )  ->  S  =  U )
118, 9, 10csbief 3292 . . . . . . 7  |-  [_ ( F `  x )  /  z ]_ S  =  U
123csbeq1d 3257 . . . . . . 7  |-  ( x  =  a  ->  [_ ( F `  x )  /  z ]_ S  =  [_ ( F `  a )  /  z ]_ S )
1311, 12syl5eqr 2482 . . . . . 6  |-  ( x  =  a  ->  U  =  [_ ( F `  a )  /  z ]_ S )
1413adantr 452 . . . . 5  |-  ( ( x  =  a  /\  y  =  b )  ->  U  =  [_ ( F `  a )  /  z ]_ S
)
15 simpr 448 . . . . 5  |-  ( ( x  =  a  /\  y  =  b )  ->  y  =  b )
167, 14, 15breq123d 4226 . . . 4  |-  ( ( x  =  a  /\  y  =  b )  ->  ( x U y  <-> 
a [_ ( F `  a )  /  z ]_ S b ) )
176, 16anbi12d 692 . . 3  |-  ( ( x  =  a  /\  y  =  b )  ->  ( ( ( F `
 x )  =  ( F `  y
)  /\  x U
y )  <->  ( ( F `  a )  =  ( F `  b )  /\  a [_ ( F `  a
)  /  z ]_ S b ) ) )
185, 17orbi12d 691 . 2  |-  ( ( x  =  a  /\  y  =  b )  ->  ( ( ( F `
 x ) R ( F `  y
)  \/  ( ( F `  x )  =  ( F `  y )  /\  x U y ) )  <-> 
( ( F `  a ) R ( F `  b )  \/  ( ( F `
 a )  =  ( F `  b
)  /\  a [_ ( F `  a )  /  z ]_ S
b ) ) ) )
19 fnwe2.t . 2  |-  T  =  { <. x ,  y
>.  |  ( ( F `  x ) R ( F `  y )  \/  (
( F `  x
)  =  ( F `
 y )  /\  x U y ) ) }
201, 2, 18, 19braba 4472 1  |-  ( a T b  <->  ( ( F `  a ) R ( F `  b )  \/  (
( F `  a
)  =  ( F `
 b )  /\  a [_ ( F `  a )  /  z ]_ S b ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    \/ wo 358    /\ wa 359    = wceq 1652   [_csb 3251   class class class wbr 4212   {copab 4265   ` cfv 5454
This theorem is referenced by:  fnwe2lem2  27126  fnwe2lem3  27127
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417  ax-sep 4330  ax-nul 4338  ax-pr 4403
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2285  df-mo 2286  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-sbc 3162  df-csb 3252  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-uni 4016  df-br 4213  df-opab 4267  df-iota 5418  df-fv 5462
  Copyright terms: Public domain W3C validator