elixx3g - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > elixx3g		Structured version Visualization version GIF version

Theorem elixx3g 13306

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.)

**Hypothesis**
Ref	Expression
ixx.1	⊢ 𝑂 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)})

**Assertion**
Ref	Expression
elixx3g	⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))

Distinct variable groups: 𝑥,𝑦,𝑧,𝐴 𝑥,𝐶,𝑦,𝑧 𝑥,𝐵,𝑦,𝑧 𝑥,𝑅,𝑦,𝑧 𝑥,𝑆,𝑦,𝑧 Allowed substitution hints: 𝑂(𝑥,𝑦,𝑧)

**Proof of Theorem elixx3g**
Step	Hyp	Ref	Expression
1		anass 470	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ 𝐶 ∈ ℝ^) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))
2		df-3an 1095	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ↔ ((𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^) ∧ 𝐶 ∈ ℝ^))
3	2	anbi1i 631	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ (((𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^) ∧ 𝐶 ∈ ℝ^) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))
4		ixx.1	. . . . 5 ⊢ 𝑂 = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥𝑅𝑧 ∧ 𝑧𝑆𝑦)})
5	4	elixx1 13302	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ (𝐶 ∈ ℝ^ ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))
6		3anass 1101	. . . . 5 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ (𝐶 ∈ ℝ^* ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))
7		ibar 534	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))))
8	6, 7	bitrid 285	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → ((𝐶 ∈ ℝ^ ∧ 𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))))
9	5, 8	bitrd 281	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))))
10	4	ixxf 13303	. . . . . . 7 ⊢ 𝑂:(ℝ^* × ℝ^)⟶𝒫 ℝ^
11	10	fdmi 6670	. . . . . 6 ⊢ dom 𝑂 = (ℝ^* × ℝ^*)
12	11	ndmov 7544	. . . . 5 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴𝑂𝐵) = ∅)
13	12	eleq2d 2827	. . . 4 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ 𝐶 ∈ ∅))
14		noel 4269	. . . . . 6 ⊢ ¬ 𝐶 ∈ ∅
15	14	pm2.21i 119	. . . . 5 ⊢ (𝐶 ∈ ∅ → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
16		simpl 484	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
17	15, 16	pm5.21ni 379	. . . 4 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ ∅ ↔ ((𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))))
18	13, 17	bitrd 281	. . 3 ⊢ (¬ (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) → (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ^ ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))))
19	9, 18	pm2.61i 183	. 2 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^) ∧ (𝐶 ∈ ℝ^ ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵))))
20	1, 3, 19	3bitr4ri 306	1 ⊢ (𝐶 ∈ (𝐴𝑂𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) ∧ (𝐴𝑅𝐶 ∧ 𝐶𝑆𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 {crab 3393 ∅c0 4264 𝒫 cpw 4532 class class class wbr 5075 × cxp 5619 (class class class)co 7360 ∈ cmpo 7362 ℝ^*cxr 11173

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 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-xr 11178

This theorem is referenced by: ixxss1 13311 ixxss2 13312 ixxss12 13313 elioo3g 13322 elicore 13346 iccss2 13365 iccssico2 13368 xrtgioo 24794 ftc1anclem7 38081 ftc1anclem8 38082 ftc1anc 38083 eliocre 45968 lbioc 45972

W3C validator