Metamath Proof Explorer


Theorem elixx3g

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 A e. RR* and B e. RR* . (Contributed by Mario Carneiro, 3-Nov-2013)

Ref Expression
Hypothesis ixx.1 ⊢ O = x ∈ ℝ * , y ∈ ℝ * ⟼ z ∈ ℝ * | x R z ∧ z S y
Assertion elixx3g ⊢ C ∈ A O B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B

Proof

Step Hyp Ref Expression
1 ixx.1 ⊢ O = x ∈ ℝ * , y ∈ ℝ * ⟼ z ∈ ℝ * | x R z ∧ z S y
2 anass ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
3 df-3an ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ *
4 3 anbi1i ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
5 1 elixx1 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ A O B ↔ C ∈ ℝ * ∧ A R C ∧ C S B
6 3anass ⊢ C ∈ ℝ * ∧ A R C ∧ C S B ↔ C ∈ ℝ * ∧ A R C ∧ C S B
7 ibar ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ ℝ * ∧ A R C ∧ C S B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
8 6 7 bitrid ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ ℝ * ∧ A R C ∧ C S B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
9 5 8 bitrd ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ A O B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
10 1 ixxf ⊢ O : ℝ * × ℝ * ⟶ 𝒫 ℝ *
11 10 fdmi ⊢ dom ⁡ O = ℝ * × ℝ *
12 11 ndmov ⊢ ¬ A ∈ ℝ * ∧ B ∈ ℝ * → A O B = ∅
13 12 eleq2d ⊢ ¬ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ A O B ↔ C ∈ ∅
14 noel ⊢ ¬ C ∈ ∅
15 14 pm2.21i ⊢ C ∈ ∅ → A ∈ ℝ * ∧ B ∈ ℝ *
16 simpl ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B → A ∈ ℝ * ∧ B ∈ ℝ *
17 15 16 pm5.21ni ⊢ ¬ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ ∅ ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
18 13 17 bitrd ⊢ ¬ A ∈ ℝ * ∧ B ∈ ℝ * → C ∈ A O B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
19 9 18 pm2.61i ⊢ C ∈ A O B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B
20 2 4 19 3bitr4ri ⊢ C ∈ A O B ↔ A ∈ ℝ * ∧ B ∈ ℝ * ∧ C ∈ ℝ * ∧ A R C ∧ C S B