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

Theorem cvrval2 32765
Description: Binary relation expressing  Y covers  X. Definition of covers in [Kalmbach] p. 15. (cvbr2 27928 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 32760 . 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 426 . . . . . . . 8  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  -.  z  =  Y )
)
6 df-ne 2621 . . . . . . . . 9  |-  ( z  =/=  Y  <->  -.  z  =  Y )
76anbi2i 699 . . . . . . . 8  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( ( X 
.<  z  /\  z  .<_  Y )  /\  -.  z  =  Y )
)
85, 7xchbinxr 313 . . . . . . 7  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y ) )
9 cvrletr.l . . . . . . . . . . . . 13  |-  .<_  =  ( le `  K )
109, 2pltval 16199 . . . . . . . . . . . 12  |-  ( ( K  e.  A  /\  z  e.  B  /\  Y  e.  B )  ->  ( z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
11103com23 1212 . . . . . . . . . . 11  |-  ( ( K  e.  A  /\  Y  e.  B  /\  z  e.  B )  ->  ( z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
12113expa 1206 . . . . . . . . . 10  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
z  .<  Y  <->  ( z  .<_  Y  /\  z  =/= 
Y ) ) )
1312anbi2d 709 . . . . . . . . 9  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( X  .<  z  /\  z  .<  Y )  <-> 
( X  .<  z  /\  ( z  .<_  Y  /\  z  =/=  Y ) ) ) )
14 anass 654 . . . . . . . . 9  |-  ( ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( X  .<  z  /\  ( z  .<_  Y  /\  z  =/=  Y
) ) )
1513, 14syl6rbbr 268 . . . . . . . 8  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  ( X  .<  z  /\  z  .<  Y ) ) )
1615notbid 296 . . . . . . 7  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  ( -.  ( ( X  .<  z  /\  z  .<_  Y )  /\  z  =/=  Y
)  <->  -.  ( X  .<  z  /\  z  .<  Y ) ) )
178, 16syl5bb 261 . . . . . 6  |-  ( ( ( K  e.  A  /\  Y  e.  B
)  /\  z  e.  B )  ->  (
( ( X  .<  z  /\  z  .<_  Y )  ->  z  =  Y )  <->  -.  ( X  .<  z  /\  z  .<  Y ) ) )
1817ralbidva 2862 . . . . 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 2872 . . . . 5  |-  ( A. z  e.  B  -.  ( X  .<  z  /\  z  .<  Y )  <->  -.  E. z  e.  B  ( X  .<  z  /\  z  .<  Y ) )
2018, 19syl6bb 265 . . . 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 709 . . 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 1025 . 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 260 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 setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 188    /\ wa 371    /\ w3a 983    = wceq 1438    e. wcel 1869    =/= wne 2619   A.wral 2776   E.wrex 2777   class class class wbr 4421   ` cfv 5599   Basecbs 15114   lecple 15190   ltcplt 16179    <o ccvr 32753
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-8 1871  ax-9 1873  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054  ax-ext 2401  ax-sep 4544  ax-nul 4553  ax-pow 4600  ax-pr 4658  ax-un 6595
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3an 985  df-tru 1441  df-ex 1661  df-nf 1665  df-sb 1788  df-eu 2270  df-mo 2271  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2573  df-ne 2621  df-ral 2781  df-rex 2782  df-rab 2785  df-v 3084  df-sbc 3301  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-nul 3763  df-if 3911  df-pw 3982  df-sn 3998  df-pr 4000  df-op 4004  df-uni 4218  df-br 4422  df-opab 4481  df-mpt 4482  df-id 4766  df-xp 4857  df-rel 4858  df-cnv 4859  df-co 4860  df-dm 4861  df-iota 5563  df-fun 5601  df-fv 5607  df-plt 16197  df-covers 32757
This theorem is referenced by:  isat3  32798  cvlcvr1  32830
  Copyright terms: Public domain W3C validator