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

Theorem ordelinel 4647
Description: The intersection of two ordinal classes is an element of a third if and only if either one of them is. (Contributed by David Moews, 1-May-2017.)
Assertion
Ref Expression
ordelinel  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( A  i^i  B )  e.  C  <->  ( A  e.  C  \/  B  e.  C ) ) )

Proof of Theorem ordelinel
StepHypRef Expression
1 ordtri2or3 4646 . . . 4  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  =  ( A  i^i  B )  \/  B  =  ( A  i^i  B
) ) )
213adant3 977 . . 3  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( A  =  ( A  i^i  B
)  \/  B  =  ( A  i^i  B
) ) )
3 eleq1 2472 . . . . 5  |-  ( A  =  ( A  i^i  B )  ->  ( A  e.  C  <->  ( A  i^i  B )  e.  C ) )
4 orc 375 . . . . 5  |-  ( A  e.  C  ->  ( A  e.  C  \/  B  e.  C )
)
53, 4syl6bir 221 . . . 4  |-  ( A  =  ( A  i^i  B )  ->  ( ( A  i^i  B )  e.  C  ->  ( A  e.  C  \/  B  e.  C ) ) )
6 eleq1 2472 . . . . 5  |-  ( B  =  ( A  i^i  B )  ->  ( B  e.  C  <->  ( A  i^i  B )  e.  C ) )
7 olc 374 . . . . 5  |-  ( B  e.  C  ->  ( A  e.  C  \/  B  e.  C )
)
86, 7syl6bir 221 . . . 4  |-  ( B  =  ( A  i^i  B )  ->  ( ( A  i^i  B )  e.  C  ->  ( A  e.  C  \/  B  e.  C ) ) )
95, 8jaoi 369 . . 3  |-  ( ( A  =  ( A  i^i  B )  \/  B  =  ( A  i^i  B ) )  ->  ( ( A  i^i  B )  e.  C  ->  ( A  e.  C  \/  B  e.  C ) ) )
102, 9syl 16 . 2  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( A  i^i  B )  e.  C  ->  ( A  e.  C  \/  B  e.  C ) ) )
11 inss1 3529 . . . 4  |-  ( A  i^i  B )  C_  A
12 ordin 4579 . . . . . . 7  |-  ( ( Ord  A  /\  Ord  B )  ->  Ord  ( A  i^i  B ) )
1312anim1i 552 . . . . . 6  |-  ( ( ( Ord  A  /\  Ord  B )  /\  Ord  C )  ->  ( Ord  ( A  i^i  B )  /\  Ord  C ) )
14133impa 1148 . . . . 5  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( Ord  ( A  i^i  B )  /\  Ord  C ) )
15 ordtr2 4593 . . . . 5  |-  ( ( Ord  ( A  i^i  B )  /\  Ord  C
)  ->  ( (
( A  i^i  B
)  C_  A  /\  A  e.  C )  ->  ( A  i^i  B
)  e.  C ) )
1614, 15syl 16 . . . 4  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( ( A  i^i  B ) 
C_  A  /\  A  e.  C )  ->  ( A  i^i  B )  e.  C ) )
1711, 16mpani 658 . . 3  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( A  e.  C  ->  ( A  i^i  B )  e.  C
) )
18 inss2 3530 . . . 4  |-  ( A  i^i  B )  C_  B
19 ordtr2 4593 . . . . 5  |-  ( ( Ord  ( A  i^i  B )  /\  Ord  C
)  ->  ( (
( A  i^i  B
)  C_  B  /\  B  e.  C )  ->  ( A  i^i  B
)  e.  C ) )
2014, 19syl 16 . . . 4  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( ( A  i^i  B ) 
C_  B  /\  B  e.  C )  ->  ( A  i^i  B )  e.  C ) )
2118, 20mpani 658 . . 3  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( B  e.  C  ->  ( A  i^i  B )  e.  C
) )
2217, 21jaod 370 . 2  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( A  e.  C  \/  B  e.  C )  ->  ( A  i^i  B )  e.  C ) )
2310, 22impbid 184 1  |-  ( ( Ord  A  /\  Ord  B  /\  Ord  C )  ->  ( ( A  i^i  B )  e.  C  <->  ( A  e.  C  \/  B  e.  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    \/ wo 358    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721    i^i cin 3287    C_ wss 3288   Ord word 4548
This theorem is referenced by:  mreexexd  13836
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393  ax-sep 4298  ax-nul 4306  ax-pr 4371
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2266  df-mo 2267  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ne 2577  df-ral 2679  df-rex 2680  df-rab 2683  df-v 2926  df-sbc 3130  df-dif 3291  df-un 3293  df-in 3295  df-ss 3302  df-pss 3304  df-nul 3597  df-if 3708  df-sn 3788  df-pr 3789  df-op 3791  df-uni 3984  df-br 4181  df-opab 4235  df-tr 4271  df-eprel 4462  df-po 4471  df-so 4472  df-fr 4509  df-we 4511  df-ord 4552
  Copyright terms: Public domain W3C validator