Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1533 Structured version   Unicode version

Theorem bnj1533 29223
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1533.1  |-  ( th 
->  A. z  e.  B  -.  z  e.  D
)
bnj1533.2  |-  B  C_  A
bnj1533.3  |-  D  =  { z  e.  A  |  C  =/=  E }
Assertion
Ref Expression
bnj1533  |-  ( th 
->  A. z  e.  B  C  =  E )

Proof of Theorem bnj1533
StepHypRef Expression
1 bnj1533.1 . . . 4  |-  ( th 
->  A. z  e.  B  -.  z  e.  D
)
21bnj1211 29169 . . 3  |-  ( th 
->  A. z ( z  e.  B  ->  -.  z  e.  D )
)
3 bnj1533.3 . . . . . . . . 9  |-  D  =  { z  e.  A  |  C  =/=  E }
43rabeq2i 2953 . . . . . . . 8  |-  ( z  e.  D  <->  ( z  e.  A  /\  C  =/= 
E ) )
54notbii 288 . . . . . . 7  |-  ( -.  z  e.  D  <->  -.  (
z  e.  A  /\  C  =/=  E ) )
6 imnan 412 . . . . . . 7  |-  ( ( z  e.  A  ->  -.  C  =/=  E
)  <->  -.  ( z  e.  A  /\  C  =/= 
E ) )
7 nne 2605 . . . . . . . 8  |-  ( -.  C  =/=  E  <->  C  =  E )
87imbi2i 304 . . . . . . 7  |-  ( ( z  e.  A  ->  -.  C  =/=  E
)  <->  ( z  e.  A  ->  C  =  E ) )
95, 6, 83bitr2i 265 . . . . . 6  |-  ( -.  z  e.  D  <->  ( z  e.  A  ->  C  =  E ) )
109imbi2i 304 . . . . 5  |-  ( ( z  e.  B  ->  -.  z  e.  D
)  <->  ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) ) )
11 bnj1533.2 . . . . . . . 8  |-  B  C_  A
1211sseli 3344 . . . . . . 7  |-  ( z  e.  B  ->  z  e.  A )
1312imim1i 56 . . . . . 6  |-  ( ( z  e.  A  ->  C  =  E )  ->  ( z  e.  B  ->  C  =  E ) )
14 ax-1 5 . . . . . . . . . 10  |-  ( ( z  e.  A  ->  C  =  E )  ->  ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) ) )
1514anim1i 552 . . . . . . . . 9  |-  ( ( ( z  e.  A  ->  C  =  E )  /\  z  e.  B
)  ->  ( (
z  e.  B  -> 
( z  e.  A  ->  C  =  E ) )  /\  z  e.  B ) )
16 simpr 448 . . . . . . . . . . 11  |-  ( ( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  z  e.  B )
17 simpl 444 . . . . . . . . . . 11  |-  ( ( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  (
z  e.  B  -> 
( z  e.  A  ->  C  =  E ) ) )
1816, 17mpd 15 . . . . . . . . . 10  |-  ( ( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  (
z  e.  A  ->  C  =  E )
)
1918, 16jca 519 . . . . . . . . 9  |-  ( ( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  (
( z  e.  A  ->  C  =  E )  /\  z  e.  B
) )
2015, 19impbii 181 . . . . . . . 8  |-  ( ( ( z  e.  A  ->  C  =  E )  /\  z  e.  B
)  <->  ( ( z  e.  B  ->  (
z  e.  A  ->  C  =  E )
)  /\  z  e.  B ) )
2120imbi1i 316 . . . . . . 7  |-  ( ( ( ( z  e.  A  ->  C  =  E )  /\  z  e.  B )  ->  C  =  E )  <->  ( (
( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  C  =  E ) )
22 impexp 434 . . . . . . 7  |-  ( ( ( ( z  e.  A  ->  C  =  E )  /\  z  e.  B )  ->  C  =  E )  <->  ( (
z  e.  A  ->  C  =  E )  ->  ( z  e.  B  ->  C  =  E ) ) )
23 impexp 434 . . . . . . 7  |-  ( ( ( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  /\  z  e.  B )  ->  C  =  E )  <-> 
( ( z  e.  B  ->  ( z  e.  A  ->  C  =  E ) )  -> 
( z  e.  B  ->  C  =  E ) ) )
2421, 22, 233bitr3i 267 . . . . . 6  |-  ( ( ( z  e.  A  ->  C  =  E )  ->  ( z  e.  B  ->  C  =  E ) )  <->  ( (
z  e.  B  -> 
( z  e.  A  ->  C  =  E ) )  ->  ( z  e.  B  ->  C  =  E ) ) )
2513, 24mpbi 200 . . . . 5  |-  ( ( z  e.  B  -> 
( z  e.  A  ->  C  =  E ) )  ->  ( z  e.  B  ->  C  =  E ) )
2610, 25sylbi 188 . . . 4  |-  ( ( z  e.  B  ->  -.  z  e.  D
)  ->  ( z  e.  B  ->  C  =  E ) )
2726alimi 1568 . . 3  |-  ( A. z ( z  e.  B  ->  -.  z  e.  D )  ->  A. z
( z  e.  B  ->  C  =  E ) )
282, 27syl 16 . 2  |-  ( th 
->  A. z ( z  e.  B  ->  C  =  E ) )
2928bnj1142 29160 1  |-  ( th 
->  A. z  e.  B  C  =  E )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359   A.wal 1549    = wceq 1652    e. wcel 1725    =/= wne 2599   A.wral 2705   {crab 2709    C_ wss 3320
This theorem is referenced by:  bnj1523  29440
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-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-ne 2601  df-ral 2710  df-rab 2714  df-in 3327  df-ss 3334
  Copyright terms: Public domain W3C validator