Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ioojoin | Structured version Visualization version GIF version |
Description: Join two open intervals to create a third. (Contributed by NM, 11-Aug-2008.) (Proof shortened by Mario Carneiro, 16-Jun-2014.) |
Ref | Expression |
---|---|
ioojoin | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) = (𝐴(,)𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unass 4080 | . 2 ⊢ (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) = ((𝐴(,)𝐵) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) | |
2 | snunioo 13066 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 < 𝐶) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) | |
3 | 2 | 3expa 1120 | . . . . . 6 ⊢ (((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ 𝐵 < 𝐶) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) |
4 | 3 | 3adantl1 1168 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ 𝐵 < 𝐶) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) |
5 | 4 | adantrl 716 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ({𝐵} ∪ (𝐵(,)𝐶)) = (𝐵[,)𝐶)) |
6 | 5 | uneq2d 4077 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,)𝐵) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) = ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶))) |
7 | df-ioo 12939 | . . . 4 ⊢ (,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)}) | |
8 | df-ico 12941 | . . . 4 ⊢ [,) = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 < 𝑦)}) | |
9 | xrlenlt 10898 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → (𝐵 ≤ 𝑤 ↔ ¬ 𝑤 < 𝐵)) | |
10 | xrlttr 12730 | . . . 4 ⊢ ((𝑤 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → ((𝑤 < 𝐵 ∧ 𝐵 < 𝐶) → 𝑤 < 𝐶)) | |
11 | xrltletr 12747 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝑤 ∈ ℝ*) → ((𝐴 < 𝐵 ∧ 𝐵 ≤ 𝑤) → 𝐴 < 𝑤)) | |
12 | 7, 8, 9, 7, 10, 11 | ixxun 12951 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,)𝐵) ∪ (𝐵[,)𝐶)) = (𝐴(,)𝐶)) |
13 | 6, 12 | eqtrd 2777 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → ((𝐴(,)𝐵) ∪ ({𝐵} ∪ (𝐵(,)𝐶))) = (𝐴(,)𝐶)) |
14 | 1, 13 | eqtrid 2789 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴 < 𝐵 ∧ 𝐵 < 𝐶)) → (((𝐴(,)𝐵) ∪ {𝐵}) ∪ (𝐵(,)𝐶)) = (𝐴(,)𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ∪ cun 3864 {csn 4541 class class class wbr 5053 (class class class)co 7213 ℝ*cxr 10866 < clt 10867 ≤ cle 10868 (,)cioo 12935 [,)cico 12937 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-pre-lttri 10803 ax-pre-lttrn 10804 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-op 4548 df-uni 4820 df-br 5054 df-opab 5116 df-mpt 5136 df-id 5455 df-po 5468 df-so 5469 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-ov 7216 df-oprab 7217 df-mpo 7218 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-ioo 12939 df-ico 12941 df-icc 12942 |
This theorem is referenced by: reconnlem1 23723 itgsplitioo 24735 lhop 24913 iocunico 40745 |
Copyright terms: Public domain | W3C validator |