![]() |
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 461 | . 2 ⊢ ((((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))) | |
2 | df-3an 1070 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*)) | |
3 | 2 | anbi1i 614 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
4 | ixx.1 | . . . . 5 ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) | |
5 | 4 | elixx1 12556 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
6 | 3anass 1076 | . . . . 5 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) | |
7 | ibar 521 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) | |
8 | 6, 7 | syl5bb 275 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
9 | 5, 8 | bitrd 271 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
10 | 4 | ixxf 12557 | . . . . . . 7 ⊢ 𝑂:(ℝ* × ℝ*)⟶𝒫 ℝ* |
11 | 10 | fdmi 6348 | . . . . . 6 ⊢ dom 𝑂 = (ℝ* × ℝ*) |
12 | 11 | ndmov 7142 | . . . . 5 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴𝑂𝐵) = ∅) |
13 | 12 | eleq2d 2845 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ 𝐶 ∈ ∅)) |
14 | noel 4178 | . . . . . 6 ⊢ ¬ 𝐶 ∈ ∅ | |
15 | 14 | pm2.21i 117 | . . . . 5 ⊢ (𝐶 ∈ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
16 | simpl 475 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) | |
17 | 15, 16 | pm5.21ni 370 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ ∅ ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
18 | 13, 17 | bitrd 271 | . . 3 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
19 | 9, 18 | pm2.61i 177 | . 2 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))) |
20 | 1, 3, 19 | 3bitr4ri 296 | 1 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 198 ∧ wa 387 ∧ w3a 1068 = wceq 1507 ∈ wcel 2048 {crab 3086 ∅c0 4173 𝒫 cpw 4416 class class class wbr 4923 × cxp 5398 (class class class)co 6970 ∈ cmpo 6972 ℝ*cxr 10465 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1964 ax-8 2050 ax-9 2057 ax-10 2077 ax-11 2091 ax-12 2104 ax-13 2299 ax-ext 2745 ax-sep 5054 ax-nul 5061 ax-pow 5113 ax-pr 5180 ax-un 7273 ax-cnex 10383 ax-resscn 10384 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2014 df-mo 2544 df-eu 2580 df-clab 2754 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ne 2962 df-ral 3087 df-rex 3088 df-rab 3091 df-v 3411 df-sbc 3678 df-csb 3783 df-dif 3828 df-un 3830 df-in 3832 df-ss 3839 df-nul 4174 df-if 4345 df-pw 4418 df-sn 4436 df-pr 4438 df-op 4442 df-uni 4707 df-iun 4788 df-br 4924 df-opab 4986 df-mpt 5003 df-id 5305 df-xp 5406 df-rel 5407 df-cnv 5408 df-co 5409 df-dm 5410 df-rn 5411 df-res 5412 df-ima 5413 df-iota 6146 df-fun 6184 df-fn 6185 df-f 6186 df-fv 6190 df-ov 6973 df-oprab 6974 df-mpo 6975 df-1st 7494 df-2nd 7495 df-xr 10470 |
This theorem is referenced by: ixxss1 12565 ixxss2 12566 ixxss12 12567 elioo3g 12576 elicore 12598 iccss2 12616 iccssico2 12619 xrtgioo 23107 ftc1anclem7 34362 ftc1anclem8 34363 ftc1anc 34364 eliocre 41162 lbioc 41166 |
Copyright terms: Public domain | W3C validator |