Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cvrval2 Structured version   Unicode version

Theorem cvrval2 29973
Description: Binary relation expressing  Y covers  X. Definition of covers in [Kalmbach] p. 15. (cvbr2 23776 analog.) (Contributed by NM, 16-Nov-2011.)
Hypotheses
Ref Expression
cvrletr.b  |-  B  =  ( Base `  K
)
cvrletr.l  |-  .<_  =  ( le `  K )
cvrletr.s  |-  .<  =  ( lt `  K )
cvrletr.c  |-  C  =  (  <o  `  K )
Assertion
Ref Expression
cvrval2  |-  ( ( K  e.  A  /\  X  e.  B  /\  Y  e.  B )  ->  ( X C Y  <-> 
( X  .<  Y  /\  A. z  e.  B  ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y ) ) ) )
Distinct variable groups:    z, A    z, B    z, K    z, X    z, Y
Allowed substitution hints:    C( z)    .< ( z)    .<_ ( z)

Proof of Theorem cvrval2
StepHypRef Expression
1 cvrletr.b . . 3  |-  B  =  ( Base `  K
)
2 cvrletr.s . . 3  |-  .<  =  ( lt `  K )
3 cvrletr.c . . 3  |-  C  =  (  <o  `  K )
41, 2, 3cvrval 29968 . 2  |-  ( ( K  e.  A  /\  X  e.  B  /\  Y  e.  B )  ->  ( X C Y  <-> 
( X  .<  Y  /\  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) ) ) )
5 iman 414 . . . . . . . 8  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  -.  z  =  Y )
)
6 df-ne 2600 . . . . . . . . 9  |-  ( z  =/=  Y  <->  -.  z  =  Y )
76anbi2i 676 . . . . . . . 8  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( ( X 
.<  z  /\  z  .<_  Y )  /\  -.  z  =  Y )
)
85, 7xchbinxr 303 . . . . . . 7  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y ) )
9 cvrletr.l . . . . . . . . . . . . 13  |-  .<_  =  ( le `  K )
109, 2pltval 14407 . . . . . . . . . . . 12  |-  ( ( K  e.  A  /\  z  e.  B  /\  Y  e.  B )  ->  ( z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
11103com23 1159 . . . . . . . . . . 11  |-  ( ( K  e.  A  /\  Y  e.  B  /\  z  e.  B )  ->  ( z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
12113expa 1153 . . . . . . . . . 10  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
1312anbi2d 685 . . . . . . . . 9  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( X  .<  z  /\  z  .<  Y )  <-> 
( X  .<  z  /\  ( z  .<_  Y  /\  z  =/=  Y ) ) ) )
14 anass 631 . . . . . . . . 9  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( X  .<  z  /\  ( z  .<_  Y  /\  z  =/=  Y
) ) )
1513, 14syl6rbbr 256 . . . . . . . 8  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( X  .<  z  /\  z  .<  Y ) ) )
1615notbid 286 . . . . . . 7  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  ( -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  -.  ( X  .<  z  /\  z  .<  Y ) ) )
178, 16syl5bb 249 . . . . . 6  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( X  .<  z  /\  z  .<  Y ) ) )
1817ralbidva 2713 . . . . 5  |-  ( ( K  e.  A  /\  Y  e.  B )  ->  ( A. z  e.  B  ( ( X 
.<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  A. z  e.  B  -.  ( X  .<  z  /\  z  .<  Y ) ) )
19 ralnex 2707 . . . . 5  |-  ( A. z  e.  B  -.  ( X  .<  z  /\  z  .<  Y )  <->  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) )
2018, 19syl6bb 253 . . . 4  |-  ( ( K  e.  A  /\  Y  e.  B )  ->  ( A. z  e.  B  ( ( X 
.<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) ) )
2120anbi2d 685 . . 3  |-  ( ( K  e.  A  /\  Y  e.  B )  ->  ( ( X  .<  Y  /\  A. z  e.  B  ( ( X 
.<  z  /\  z  .<_  Y )  ->  z  =  Y ) )  <->  ( X  .<  Y  /\  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) ) ) )
22213adant2 976 . 2  |-  ( ( K  e.  A  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .<  Y  /\  A. z  e.  B  ( ( X 
.<  z  /\  z  .<_  Y )  ->  z  =  Y ) )  <->  ( X  .<  Y  /\  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) ) ) )
234, 22bitr4d 248 1  |-  ( ( K  e.  A  /\  X  e.  B  /\  Y  e.  B )  ->  ( X C Y  <-> 
( X  .<  Y  /\  A. z  e.  B  ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y ) ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    /\ w3a 936    = wceq 1652    e. wcel 1725    =/= wne 2598   A.wral 2697   E.wrex 2698   class class class wbr 4204   ` cfv 5446   Basecbs 13459   lecple 13526   ltcplt 14388    <o ccvr 29961
This theorem is referenced by:  isat3  30006  cvlcvr1  30038
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-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693
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 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-sbc 3154  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-mpt 4260  df-id 4490  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-iota 5410  df-fun 5448  df-fv 5454  df-plt 14405  df-covers 29965
  Copyright terms: Public domain W3C validator