HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iooint 6372
Description: Intersection of two open intervals of extended reals.
Assertion
Ref Expression
iooint |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> ((A(,)B) i^i (C(,)D)) = (if(A <_ C, C, A)(,)if(B <_ D, B, D)))

Proof of Theorem iooint
StepHypRef Expression
1 xrmaxltt 5913 . . . . . . . . 9 |- ((A e. RR* /\ C e. RR* /\ x e. RR*) -> (if(A <_ C, C, A) < x <-> (A < x /\ C < x)))
213expa 833 . . . . . . . 8 |- (((A e. RR* /\ C e. RR*) /\ x e. RR*) -> (if(A <_ C, C, A) < x <-> (A < x /\ C < x)))
32adantlr 393 . . . . . . 7 |- ((((A e. RR* /\ C e. RR*) /\ (B e. RR* /\ D e. RR*)) /\ x e. RR*) -> (if(A <_ C, C, A) < x <-> (A < x /\ C < x)))
4 xrltmint 5914 . . . . . . . . . 10 |- ((x e. RR* /\ B e. RR* /\ D e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
543coml 840 . . . . . . . . 9 |- ((B e. RR* /\ D e. RR* /\ x e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
653expa 833 . . . . . . . 8 |- (((B e. RR* /\ D e. RR*) /\ x e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
76adantll 392 . . . . . . 7 |- ((((A e. RR* /\ C e. RR*) /\ (B e. RR* /\ D e. RR*)) /\ x e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
83, 7anbi12d 628 . . . . . 6 |- ((((A e. RR* /\ C e. RR*) /\ (B e. RR* /\ D e. RR*)) /\ x e. RR*) -> ((if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D)) <-> ((A < x /\ C < x) /\ (x < B /\ x < D))))
9 an4 506 . . . . . 6 |- (((A < x /\ C < x) /\ (x < B /\ x < D)) <-> ((A < x /\ x < B) /\ (C < x /\ x < D)))
108, 9syl6bb 536 . . . . 5 |- ((((A e. RR* /\ C e. RR*) /\ (B e. RR* /\ D e. RR*)) /\ x e. RR*) -> ((if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D)) <-> ((A < x /\ x < B) /\ (C < x /\ x < D))))
1110rabbidv 1806 . . . 4 |- (((A e. RR* /\ C e. RR*) /\ (B e. RR* /\ D e. RR*)) -> {x e. RR* | (if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D))} = {x e. RR* | ((A < x /\ x < B) /\ (C < x /\ x < D))})
1211an4s 508 . . 3 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> {x e. RR* | (if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D))} = {x e. RR* | ((A < x /\ x < B) /\ (C < x /\ x < D))})
13 inrab 2271 . . 3 |- ({x e. RR* | (A < x /\ x < B)} i^i {x e. RR* | (C < x /\ x < D)}) = {x e. RR* | ((A < x /\ x < B) /\ (C < x /\ x < D))}
1412, 13syl6reqr 1526 . 2 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> ({x e. RR* | (A < x /\ x < B)} i^i {x e. RR* | (C < x /\ x < D)}) = {x e. RR* | (if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D))})
15 ioovalt 6366 . . 3 |- ((A e. RR* /\ B e. RR*) -> (A(,)B) = {x e. RR* | (A < x /\ x < B)})
16 ioovalt 6366 . . 3 |- ((C e. RR* /\ D e. RR*) -> (C(,)D) = {x e. RR* | (C < x /\ x < D)})
1715, 16ineqan12d 2219 . 2 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> ((A(,)B) i^i (C(,)D)) = ({x e. RR* | (A < x /\ x < B)} i^i {x e. RR* | (C < x /\ x < D)}))
18 ioovalt 6366 . . 3 |- ((if(A <_ C, C, A) e. RR* /\ if(B <_ D, B, D) e. RR*) -> (if(A <_ C, C, A)(,)if(B <_ D, B, D)) = {x e. RR* | (if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D))})
19 ifcl 2380 . . . . 5 |- ((C e. RR* /\ A e. RR*) -> if(A <_ C, C, A) e. RR*)
2019ancoms 436 . . . 4 |- ((A e. RR* /\ C e. RR*) -> if(A <_ C, C, A) e. RR*)
2120ad2ant2r 409 . . 3 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> if(A <_ C, C, A) e. RR*)
22 ifcl 2380 . . . 4 |- ((B e. RR* /\ D e. RR*) -> if(B <_ D, B, D) e. RR*)
2322ad2ant2l 408 . . 3 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> if(B <_ D, B, D) e. RR*)
2418, 21, 23sylanc 471 . 2 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> (if(A <_ C, C, A)(,)if(B <_ D, B, D)) = {x e. RR* | (if(A <_ C, C, A) < x /\ x < if(B <_ D, B, D))})
2514, 17, 243eqtr4d 1517 1 |- (((A e. RR* /\ B e. RR*) /\ (C e. RR* /\ D e. RR*)) -> ((A(,)B) i^i (C(,)D)) = (if(A <_ C, C, A)(,)if(B <_ D, B, D)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958  {crab 1648   i^i cin 2046  ifcif 2361   class class class wbr 2619  (class class class)co 3963   <_ cle 5295  RR*cxr 5485   < clt 5486  (,)cioo 6357
This theorem is referenced by:  retopbas 7655
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866  ax-inf2 4625
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-nel 1588  df-ral 1649  df-rex 1650  df-reu 1651  df-rab 1652  df-v 1812  df-sbc 1942  df-csb 2002  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-pss 2055  df-nul 2281  df-if 2362  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-int 2534  df-iun 2568  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-id 2835  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-lim 2953  df-suc 2954  df-om 3132  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-f1 3195  df-fo 3196  df-f1o 3197  df-fv 3198  df-rdg 3932  df-opr 3965  df-oprab 3966  df-1st 4079  df-2nd 4080  df-1o 4133  df-oadd 4135  df-omul 4136  df-er 4261  df-ec 4263  df-qs 4266  df-en 4368  df-dom 4369  df-sdom 4370  df-ni 5000  df-pli 5001  df-mi 5002  df-lti 5003  df-plpq 5035  df-mpq 5036  df-enq 5037  df-nq 5038  df-plq 5039  df-mq 5040  df-rq 5041  df-ltq 5042  df-1q 5043  df-np 5086  df-1p 5087  df-plp 5088  df-ltp 5090  df-enr 5166  df-nr 5167  df-ltr 5170  df-0r 5171  df-c 5240  df-r 5244  df-lt 5247  df-pnf 5487  df-mnf 5488  df-xr 5489  df-ltxr 5490  df-le 5491  df-ioo 6361
Copyright terms: Public domain