Theorem ioodisj 10326

Description: If the upper bound of one open interval is less than or equal to the lower bound of the other, the intervals are disjoint. (Contributed by Jeff Hankins, 13-Jul-2009.)

Assertion

Ref	Expression
ioodisj	|- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( ( A (,) B ) i^i ( C (,) D ) ) = (/) )

Proof of Theorem ioodisj

Dummy variables x w y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpllr 536	. . . . . 6 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> B e. RR* )
2		iooss1 10249	. . . . . 6 |- ( ( B e. RR* /\ B <_ C ) -> ( C (,) D ) C_ ( B (,) D ) )
3	1, 2	sylancom 420	. . . . 5 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( C (,) D ) C_ ( B (,) D ) )
4		ioossicc 10292	. . . . 5 |- ( B (,) D ) C_ ( B [,] D )
5	3, 4	sstrdi 3250	. . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( C (,) D ) C_ ( B [,] D ) )
6		sslin 3447	. . . 4 |- ( ( C (,) D ) C_ ( B [,] D ) -> ( ( A (,) B ) i^i ( C (,) D ) ) C_ ( ( A (,) B ) i^i ( B [,] D ) ) )
7	5, 6	syl 14	. . 3 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( ( A (,) B ) i^i ( C (,) D ) ) C_ ( ( A (,) B ) i^i ( B [,] D ) ) )
8		simplll 535	. . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> A e. RR* )
9		simplrr 538	. . . 4 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> D e. RR* )
10		df-ioo 10225	. . . . 5 |- (,) = ( x e. RR* , y e. RR* |-> { z e. RR* | ( x < z /\ z < y ) } )
11		df-icc 10228	. . . . 5 |- [,] = ( x e. RR* , y e. RR* |-> { z e. RR* | ( x <_ z /\ z <_ y ) } )
12		xrlenlt 8338	. . . . 5 |- ( ( B e. RR* /\ w e. RR* ) -> ( B <_ w <-> -. w < B ) )
13	10, 11, 12	ixxdisj 10236	. . . 4 |- ( ( A e. RR* /\ B e. RR* /\ D e. RR* ) -> ( ( A (,) B ) i^i ( B [,] D ) ) = (/) )
14	8, 1, 9, 13	syl3anc 1274	. . 3 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( ( A (,) B ) i^i ( B [,] D ) ) = (/) )
15	7, 14	sseqtrd 3276	. 2 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( ( A (,) B ) i^i ( C (,) D ) ) C_ (/) )
16		ss0 3549	. 2 |- ( ( ( A (,) B ) i^i ( C (,) D ) ) C_ (/) -> ( ( A (,) B ) i^i ( C (,) D ) ) = (/) )
17	15, 16	syl 14	1 |- ( ( ( ( A e. RR* /\ B e. RR* ) /\ ( C e. RR* /\ D e. RR* ) ) /\ B <_ C ) -> ( ( A (,) B ) i^i ( C (,) D ) ) = (/) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2203   i^i cin 3210   C_ wss 3211   (/)c0 3508   class class class wbr 4109  (class class class)co 6050   RR*cxr 8307   < clt 8308   <_ cle 8309   (,)cioo 10221   [,]cicc 10224

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-ioo 10225  df-icc 10228

This theorem is referenced by: (None)