ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fzass4 Unicode version
Theorem fzass4 10258
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 527 . . . . 5 |- ( ( ( B e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) ) -> B e. ( ZZ>= ` A ) )
2 simprl 529 . . . . 5 |- ( ( ( B e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) ) -> C e. ( ZZ>= ` B ) )
31, 2jca 306 . . . 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 9739 . . . . . 6 |- ( ( C e. ( ZZ>= ` B ) /\ B e. ( ZZ>= ` A ) ) -> C e. ( ZZ>= ` A ) )
54ancoms 268 . . . . 5 |- ( ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) -> C e. ( ZZ>= ` A ) )
65ad2ant2r 509 . . . 4 |- ( ( ( B e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) ) -> C e. ( ZZ>= ` A ) )
7 simprr 531 . . . 4 |- ( ( ( B e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) ) -> D e. ( ZZ>= ` C ) )
83, 6, 7jca32 310 . . 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 527 . . . . 5 |- ( ( ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` C ) ) ) -> B e. ( ZZ>= ` A ) )
10 uztrn 9739 . . . . . . 7 |- ( ( D e. ( ZZ>= ` C ) /\ C e. ( ZZ>= ` B ) ) -> D e. ( ZZ>= ` B ) )
1110ancoms 268 . . . . . 6 |- ( ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) -> D e. ( ZZ>= ` B ) )
1211ad2ant2l 508 . . . . 5 |- ( ( ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` C ) ) ) -> D e. ( ZZ>= ` B ) )
139, 12jca 306 . . . 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 528 . . . 4 |- ( ( ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` C ) ) ) -> C e. ( ZZ>= ` B ) )
15 simprr 531 . . . 4 |- ( ( ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) /\ ( C e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` C ) ) ) -> D e. ( ZZ>= ` C ) )
1613, 14, 15jca32 310 . . 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 126 . 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 10215 . . 3 |- ( B e. ( A ... D ) <-> ( B e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` B ) ) )
19 elfzuzb 10215 . . 3 |- ( C e. ( B ... D ) <-> ( C e. ( ZZ>= ` B ) /\ D e. ( ZZ>= ` C ) ) )
2018, 19anbi12i 460 . 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 10215 . . 3 |- ( B e. ( A ... C ) <-> ( B e. ( ZZ>= ` A ) /\ C e. ( ZZ>= ` B ) ) )
22 elfzuzb 10215 . . 3 |- ( C e. ( A ... D ) <-> ( C e. ( ZZ>= ` A ) /\ D e. ( ZZ>= ` C ) ) )
2321, 22anbi12i 460 . 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 212 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 104   <-> wb 105   e. wcel 2200   ` cfv 5318  (class class class)co 6001   ZZ>=cuz 9722   ...cfz 10204
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-pre-ltwlin 8112
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-neg 8320  df-z 9447  df-uz 9723  df-fz 10205
This theorem is referenced by:  ccatswrd  11202  ccatpfx  11233
  Copyright terms: Public domain W3C validator