Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elixx3g | Structured version Visualization version GIF version |
Description: Membership in a set of open intervals of extended reals. We use the fact that an operation's value is empty outside of its domain to show 𝐴 ∈ ℝ* and 𝐵 ∈ ℝ*. (Contributed by Mario Carneiro, 3-Nov-2013.) |
Ref | Expression |
---|---|
ixx.1 | ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) |
Ref | Expression |
---|---|
elixx3g | ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | anass 468 | . 2 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))) | |
2 | df-3an 1087 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*)) | |
3 | 2 | anbi1i 623 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
4 | ixx.1 | . . . . 5 ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) | |
5 | 4 | elixx1 13017 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
6 | 3anass 1093 | . . . . 5 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) | |
7 | ibar 528 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) | |
8 | 6, 7 | syl5bb 282 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
9 | 5, 8 | bitrd 278 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
10 | 4 | ixxf 13018 | . . . . . . 7 ⊢ 𝑂:(ℝ* × ℝ*)⟶𝒫 ℝ* |
11 | 10 | fdmi 6596 | . . . . . 6 ⊢ dom 𝑂 = (ℝ* × ℝ*) |
12 | 11 | ndmov 7434 | . . . . 5 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴𝑂𝐵) = ∅) |
13 | 12 | eleq2d 2824 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ 𝐶 ∈ ∅)) |
14 | noel 4261 | . . . . . 6 ⊢ ¬ 𝐶 ∈ ∅ | |
15 | 14 | pm2.21i 119 | . . . . 5 ⊢ (𝐶 ∈ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
16 | simpl 482 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) | |
17 | 15, 16 | pm5.21ni 378 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ ∅ ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
18 | 13, 17 | bitrd 278 | . . 3 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
19 | 9, 18 | pm2.61i 182 | . 2 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))) |
20 | 1, 3, 19 | 3bitr4ri 303 | 1 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 {crab 3067 ∅c0 4253 𝒫 cpw 4530 class class class wbr 5070 × cxp 5578 (class class class)co 7255 ∈ cmpo 7257 ℝ*cxr 10939 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-xr 10944 |
This theorem is referenced by: ixxss1 13026 ixxss2 13027 ixxss12 13028 elioo3g 13037 elicore 13060 iccss2 13079 iccssico2 13082 xrtgioo 23875 ftc1anclem7 35783 ftc1anclem8 35784 ftc1anc 35785 eliocre 42937 lbioc 42941 |
Copyright terms: Public domain | W3C validator |