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

Theorem iooint 6327
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 5875 . . . . . . . . 9 |- ((A e. RR* /\ C e. RR* /\ x e. RR*) -> (if(A <_ C, C, A) < x <-> (A < x /\ C < x)))
213expa 832 . . . . . . . 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 5876 . . . . . . . . . 10 |- ((x e. RR* /\ B e. RR* /\ D e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
543coml 839 . . . . . . . . 9 |- ((B e. RR* /\ D e. RR* /\ x e. RR*) -> (x < if(B <_ D, B, D) <-> (x < B /\ x < D)))
653expa 832 . . . . . . . 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 627 . . . . . 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 535 . . . . 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 1804 . . . 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 2269 . . 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 1525 . 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 6321 . . 3 |- ((A e. RR* /\ B e. RR*) -> (A(,)B) = {x e. RR* | (A < x /\ x < B)})
16 ioovalt 6321 . . 3 |- ((C e. RR* /\ D e. RR*) -> (C(,)D) = {x e. RR* | (C < x /\ x < D)})
1715, 16ineqan12d 2217 . 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 6321 . . 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 2378 . . . . 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 2378 . . . 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 1516 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 955   e. wcel 957  {crab 1647   i^i cin 2044  ifcif 2359   class class class wbr 2616  (class class class)co 3960   <_ cle 5282  RR*cxr 5472   < clt 5473  (,)cioo 6312
This theorem is referenced by:  retopbas 7634
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2690  ax-sep 2700  ax-nul 2707  ax-pow 2739  ax-pr 2776  ax-un 2863  ax-inf2 4612
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1586  df-nel 1587  df-ral 1648  df-rex 1649  df-reu 1650  df-rab 1651  df-v 1810  df-sbc 1940  df-csb 2000  df-dif 2047  df-un 2048  df-in 2049  df-ss 2051  df-pss 2053  df-nul 2279  df-if 2360  df-pw 2400  df-sn 2410  df-pr 2411  df-tp 2413  df-op 2414  df-uni 2501  df-int 2531  df-iun 2565  df-br 2617  df-opab 2664  df-tr 2678  df-eprel 2829  df-id 2832  df-po 2837  df-so 2847  df-fr 2914  df-we 2931  df-ord 2948  df-on 2949  df-lim 2950  df-suc 2951  df-om 3129  df-xp 3181  df-rel 3182  df-cnv 3183  df-co 3184  df-dm 3185  df-rn 3186  df-res 3187  df-ima 3188  df-fun 3189  df-fn 3190  df-f 3191  df-f1 3192  df-fo 3193  df-f1o 3194  df-fv 3195  df-rdg 3929  df-opr 3962  df-oprab 3963  df-1st 4076  df-2nd 4077  df-1o 4130  df-oadd 4132  df-omul 4133  df-er 4258  df-ec 4260  df-qs 4263  df-en 4364  df-dom 4365  df-sdom 4366  df-ni 4987  df-pli 4988  df-mi 4989  df-lti 4990  df-plpq 5022  df-mpq 5023  df-enq 5024  df-nq 5025  df-plq 5026  df-mq 5027  df-rq 5028  df-ltq 5029  df-1q 5030  df-np 5073  df-1p 5074  df-plp 5075  df-ltp 5077  df-enr 5153  df-nr 5154  df-ltr 5157  df-0r 5158  df-c 5227  df-r 5231  df-lt 5234  df-pnf 5474  df-mnf 5475  df-xr 5476  df-ltxr 5477  df-le 5478  df-ioo 6316
Copyright terms: Public domain