Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sstrALT2 Unicode version

Theorem sstrALT2 28801
Description: Virtual deduction proof of sstr 3348, transitivity of subclasses, Theorem 6 of [Suppes] p. 23. This theorem was automatically generated from sstrALT2VD 28800 using the command file translatewithout_overwriting.cmd . It was not minimized because the automated minimization excluding duplicates generates a minimized proof which, although not directly containing any duplicates, indirectly contains a duplicate. That is, the trace back of the minimized proof contains a duplicate. This is undesirable because some step(s) of the minimized proof use the proven theorem. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
sstrALT2  |-  ( ( A  C_  B  /\  B  C_  C )  ->  A  C_  C )

Proof of Theorem sstrALT2
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 dfss2 3329 . 2  |-  ( A 
C_  C  <->  A. x
( x  e.  A  ->  x  e.  C ) )
2 id 20 . . . . . 6  |-  ( ( A  C_  B  /\  B  C_  C )  -> 
( A  C_  B  /\  B  C_  C ) )
3 simpr 448 . . . . . 6  |-  ( ( A  C_  B  /\  B  C_  C )  ->  B  C_  C )
42, 3syl 16 . . . . 5  |-  ( ( A  C_  B  /\  B  C_  C )  ->  B  C_  C )
5 simpl 444 . . . . . . 7  |-  ( ( A  C_  B  /\  B  C_  C )  ->  A  C_  B )
62, 5syl 16 . . . . . 6  |-  ( ( A  C_  B  /\  B  C_  C )  ->  A  C_  B )
7 idd 22 . . . . . 6  |-  ( ( A  C_  B  /\  B  C_  C )  -> 
( x  e.  A  ->  x  e.  A ) )
8 ssel2 3335 . . . . . 6  |-  ( ( A  C_  B  /\  x  e.  A )  ->  x  e.  B )
96, 7, 8ee12an 1372 . . . . 5  |-  ( ( A  C_  B  /\  B  C_  C )  -> 
( x  e.  A  ->  x  e.  B ) )
10 ssel2 3335 . . . . 5  |-  ( ( B  C_  C  /\  x  e.  B )  ->  x  e.  C )
114, 9, 10ee12an 1372 . . . 4  |-  ( ( A  C_  B  /\  B  C_  C )  -> 
( x  e.  A  ->  x  e.  C ) )
1211idi 2 . . 3  |-  ( ( A  C_  B  /\  B  C_  C )  -> 
( x  e.  A  ->  x  e.  C ) )
1312alrimiv 1641 . 2  |-  ( ( A  C_  B  /\  B  C_  C )  ->  A. x ( x  e.  A  ->  x  e.  C ) )
14 bi2 190 . 2  |-  ( ( A  C_  C  <->  A. x
( x  e.  A  ->  x  e.  C ) )  ->  ( A. x ( x  e.  A  ->  x  e.  C )  ->  A  C_  C ) )
151, 13, 14mpsyl 61 1  |-  ( ( A  C_  B  /\  B  C_  C )  ->  A  C_  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   A.wal 1549    e. wcel 1725    C_ wss 3312
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 2416
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 2422  df-cleq 2428  df-clel 2431  df-in 3319  df-ss 3326
  Copyright terms: Public domain W3C validator