ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fzass4 Unicode version

Theorem fzass4 8925
Description: Two ways to express a nondecreasing sequence of four integers. (Contributed by Stefan O'Rear, 15-Aug-2015.)
Assertion
Ref Expression
fzass4  |-  ( ( B  e.  ( A ... D )  /\  C  e.  ( B ... D ) )  <->  ( B  e.  ( A ... C
)  /\  C  e.  ( A ... D ) ) )

Proof of Theorem fzass4
StepHypRef Expression
1 simpll 481 . . . . 5  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  B  e.  (
ZZ>= `  A ) )
2 simprl 483 . . . . 5  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  C  e.  (
ZZ>= `  B ) )
31, 2jca 290 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  ( B  e.  ( ZZ>= `  A )  /\  C  e.  ( ZZ>=
`  B ) ) )
4 uztrn 8489 . . . . . 6  |-  ( ( C  e.  ( ZZ>= `  B )  /\  B  e.  ( ZZ>= `  A )
)  ->  C  e.  ( ZZ>= `  A )
)
54ancoms 255 . . . . 5  |-  ( ( B  e.  ( ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B )
)  ->  C  e.  ( ZZ>= `  A )
)
65ad2ant2r 478 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  C  e.  (
ZZ>= `  A ) )
7 simprr 484 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  D  e.  (
ZZ>= `  C ) )
83, 6, 7jca32 293 . . 3  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  ( ( B  e.  ( ZZ>= `  A
)  /\  C  e.  ( ZZ>= `  B )
)  /\  ( C  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  C ) ) ) )
9 simpll 481 . . . . 5  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  B  e.  (
ZZ>= `  A ) )
10 uztrn 8489 . . . . . . 7  |-  ( ( D  e.  ( ZZ>= `  C )  /\  C  e.  ( ZZ>= `  B )
)  ->  D  e.  ( ZZ>= `  B )
)
1110ancoms 255 . . . . . 6  |-  ( ( C  e.  ( ZZ>= `  B )  /\  D  e.  ( ZZ>= `  C )
)  ->  D  e.  ( ZZ>= `  B )
)
1211ad2ant2l 477 . . . . 5  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  D  e.  (
ZZ>= `  B ) )
139, 12jca 290 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  ( B  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  B ) ) )
14 simplr 482 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  C  e.  (
ZZ>= `  B ) )
15 simprr 484 . . . 4  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  D  e.  (
ZZ>= `  C ) )
1613, 14, 15jca32 293 . . 3  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  A )  /\  D  e.  ( ZZ>= `  C ) ) )  ->  ( ( B  e.  ( ZZ>= `  A
)  /\  D  e.  ( ZZ>= `  B )
)  /\  ( C  e.  ( ZZ>= `  B )  /\  D  e.  ( ZZ>=
`  C ) ) ) )
178, 16impbii 117 . 2  |-  ( ( ( B  e.  (
ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B ) )  /\  ( C  e.  ( ZZ>=
`  B )  /\  D  e.  ( ZZ>= `  C ) ) )  <-> 
( ( B  e.  ( ZZ>= `  A )  /\  C  e.  ( ZZ>=
`  B ) )  /\  ( C  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  C ) ) ) )
18 elfzuzb 8884 . . 3  |-  ( B  e.  ( A ... D )  <->  ( B  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  B ) ) )
19 elfzuzb 8884 . . 3  |-  ( C  e.  ( B ... D )  <->  ( C  e.  ( ZZ>= `  B )  /\  D  e.  ( ZZ>=
`  C ) ) )
2018, 19anbi12i 433 . 2  |-  ( ( B  e.  ( A ... D )  /\  C  e.  ( B ... D ) )  <->  ( ( B  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>= `  B )
)  /\  ( C  e.  ( ZZ>= `  B )  /\  D  e.  ( ZZ>=
`  C ) ) ) )
21 elfzuzb 8884 . . 3  |-  ( B  e.  ( A ... C )  <->  ( B  e.  ( ZZ>= `  A )  /\  C  e.  ( ZZ>=
`  B ) ) )
22 elfzuzb 8884 . . 3  |-  ( C  e.  ( A ... D )  <->  ( C  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  C ) ) )
2321, 22anbi12i 433 . 2  |-  ( ( B  e.  ( A ... C )  /\  C  e.  ( A ... D ) )  <->  ( ( B  e.  ( ZZ>= `  A )  /\  C  e.  ( ZZ>= `  B )
)  /\  ( C  e.  ( ZZ>= `  A )  /\  D  e.  ( ZZ>=
`  C ) ) ) )
2417, 20, 233bitr4i 201 1  |-  ( ( B  e.  ( A ... D )  /\  C  e.  ( B ... D ) )  <->  ( B  e.  ( A ... C
)  /\  C  e.  ( A ... D ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    <-> wb 98    e. wcel 1393   ` cfv 4902  (class class class)co 5512   ZZ>=cuz 8473   ...cfz 8874
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-cnex 6975  ax-resscn 6976  ax-pre-ltwlin 6997
This theorem depends on definitions:  df-bi 110  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-nel 2207  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-pnf 7062  df-mnf 7063  df-xr 7064  df-ltxr 7065  df-le 7066  df-neg 7185  df-z 8246  df-uz 8474  df-fz 8875
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator