![]() |
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 1089 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*)) | |
3 | 2 | anbi1i 623 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
4 | ixx.1 | . . . . 5 ⊢ 𝑂 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ {𝑧 ∈ ℝ* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)}) | |
5 | 4 | elixx1 13416 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ (𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
6 | 3anass 1095 | . . . . 5 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) | |
7 | ibar 528 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) | |
8 | 6, 7 | bitrid 283 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐶 ∈ ℝ* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
9 | 5, 8 | bitrd 279 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
10 | 4 | ixxf 13417 | . . . . . . 7 ⊢ 𝑂:(ℝ* × ℝ*)⟶𝒫 ℝ* |
11 | 10 | fdmi 6758 | . . . . . 6 ⊢ dom 𝑂 = (ℝ* × ℝ*) |
12 | 11 | ndmov 7634 | . . . . 5 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴𝑂𝐵) = ∅) |
13 | 12 | eleq2d 2830 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ 𝐶 ∈ ∅)) |
14 | noel 4360 | . . . . . 6 ⊢ ¬ 𝐶 ∈ ∅ | |
15 | 14 | pm2.21i 119 | . . . . 5 ⊢ (𝐶 ∈ ∅ → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) |
16 | simpl 482 | . . . . 5 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) → (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*)) | |
17 | 15, 16 | pm5.21ni 377 | . . . 4 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ ∅ ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
18 | 13, 17 | bitrd 279 | . . 3 ⊢ (¬ (𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))) |
19 | 9, 18 | pm2.61i 182 | . 2 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))) |
20 | 1, 3, 19 | 3bitr4ri 304 | 1 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 {crab 3443 ∅c0 4352 𝒫 cpw 4622 class class class wbr 5166 × cxp 5698 (class class class)co 7448 ∈ cmpo 7450 ℝ*cxr 11323 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-xr 11328 |
This theorem is referenced by: ixxss1 13425 ixxss2 13426 ixxss12 13427 elioo3g 13436 elicore 13459 iccss2 13478 iccssico2 13481 xrtgioo 24847 ftc1anclem7 37659 ftc1anclem8 37660 ftc1anc 37661 eliocre 45427 lbioc 45431 |
Copyright terms: Public domain | W3C validator |