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

Theorem sseliALT 4568
Description: Alternate proof of sseli 3485 illustrating the use of the weak deduction theorem to prove it from the inference sselii 3486. (Contributed by NM, 24-Aug-2018.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
sseliALT.1  |-  A  C_  B
Assertion
Ref Expression
sseliALT  |-  ( C  e.  A  ->  C  e.  B )

Proof of Theorem sseliALT
StepHypRef Expression
1 biidd 237 . 2  |-  ( A  =  if ( C  e.  A ,  A ,  { (/) } )  -> 
( C  e.  B  <->  C  e.  B ) )
2 eleq2 2516 . 2  |-  ( B  =  if ( C  e.  A ,  B ,  { (/) } )  -> 
( C  e.  B  <->  C  e.  if ( C  e.  A ,  B ,  { (/) } ) ) )
3 eleq1 2515 . 2  |-  ( C  =  if ( C  e.  A ,  C ,  (/) )  ->  ( C  e.  if ( C  e.  A ,  B ,  { (/) } )  <-> 
if ( C  e.  A ,  C ,  (/) )  e.  if ( C  e.  A ,  B ,  { (/) } ) ) )
4 sseq1 3510 . . . 4  |-  ( A  =  if ( C  e.  A ,  A ,  { (/) } )  -> 
( A  C_  B  <->  if ( C  e.  A ,  A ,  { (/) } )  C_  B )
)
5 sseq2 3511 . . . 4  |-  ( B  =  if ( C  e.  A ,  B ,  { (/) } )  -> 
( if ( C  e.  A ,  A ,  { (/) } )  C_  B 
<->  if ( C  e.  A ,  A ,  { (/) } )  C_  if ( C  e.  A ,  B ,  { (/) } ) ) )
6 biidd 237 . . . 4  |-  ( C  =  if ( C  e.  A ,  C ,  (/) )  ->  ( if ( C  e.  A ,  A ,  { (/) } )  C_  if ( C  e.  A ,  B ,  { (/) } )  <-> 
if ( C  e.  A ,  A ,  { (/) } )  C_  if ( C  e.  A ,  B ,  { (/) } ) ) )
7 sseq1 3510 . . . 4  |-  ( {
(/) }  =  if ( C  e.  A ,  A ,  { (/) } )  ->  ( { (/)
}  C_  { (/) }  <->  if ( C  e.  A ,  A ,  { (/) } ) 
C_  { (/) } ) )
8 sseq2 3511 . . . 4  |-  ( {
(/) }  =  if ( C  e.  A ,  B ,  { (/) } )  ->  ( if ( C  e.  A ,  A ,  { (/) } )  C_  { (/) }  <->  if ( C  e.  A ,  A ,  { (/) } ) 
C_  if ( C  e.  A ,  B ,  { (/) } ) ) )
9 biidd 237 . . . 4  |-  ( (/)  =  if ( C  e.  A ,  C ,  (/) )  ->  ( if ( C  e.  A ,  A ,  { (/) } )  C_  if ( C  e.  A ,  B ,  { (/) } )  <-> 
if ( C  e.  A ,  A ,  { (/) } )  C_  if ( C  e.  A ,  B ,  { (/) } ) ) )
10 sseliALT.1 . . . 4  |-  A  C_  B
11 ssid 3508 . . . 4  |-  { (/) } 
C_  { (/) }
124, 5, 6, 7, 8, 9, 10, 11keephyp3v 3993 . . 3  |-  if ( C  e.  A ,  A ,  { (/) } ) 
C_  if ( C  e.  A ,  B ,  { (/) } )
13 eleq2 2516 . . . 4  |-  ( A  =  if ( C  e.  A ,  A ,  { (/) } )  -> 
( C  e.  A  <->  C  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
14 biidd 237 . . . 4  |-  ( B  =  if ( C  e.  A ,  B ,  { (/) } )  -> 
( C  e.  if ( C  e.  A ,  A ,  { (/) } )  <->  C  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
15 eleq1 2515 . . . 4  |-  ( C  =  if ( C  e.  A ,  C ,  (/) )  ->  ( C  e.  if ( C  e.  A ,  A ,  { (/) } )  <-> 
if ( C  e.  A ,  C ,  (/) )  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
16 eleq2 2516 . . . 4  |-  ( {
(/) }  =  if ( C  e.  A ,  A ,  { (/) } )  ->  ( (/)  e.  { (/)
}  <->  (/)  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
17 biidd 237 . . . 4  |-  ( {
(/) }  =  if ( C  e.  A ,  B ,  { (/) } )  ->  ( (/)  e.  if ( C  e.  A ,  A ,  { (/) } )  <->  (/)  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
18 eleq1 2515 . . . 4  |-  ( (/)  =  if ( C  e.  A ,  C ,  (/) )  ->  ( (/)  e.  if ( C  e.  A ,  A ,  { (/) } )  <->  if ( C  e.  A ,  C ,  (/) )  e.  if ( C  e.  A ,  A ,  { (/) } ) ) )
19 0ex 4567 . . . . 5  |-  (/)  e.  _V
2019snid 4042 . . . 4  |-  (/)  e.  { (/)
}
2113, 14, 15, 16, 17, 18, 20elimhyp3v 3987 . . 3  |-  if ( C  e.  A ,  C ,  (/) )  e.  if ( C  e.  A ,  A ,  { (/) } )
2212, 21sselii 3486 . 2  |-  if ( C  e.  A ,  C ,  (/) )  e.  if ( C  e.  A ,  B ,  { (/) } )
231, 2, 3, 22dedth3v 3983 1  |-  ( C  e.  A  ->  C  e.  B )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1383    e. wcel 1804    C_ wss 3461   (/)c0 3770   ifcif 3926   {csn 4014
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-nul 4566
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-v 3097  df-dif 3464  df-in 3468  df-ss 3475  df-nul 3771  df-if 3927  df-sn 4015
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator