Metamath Proof Explorer


Theorem pimxrneun

Description: The preimage of a set of extended reals that does not contain a value C is the union of the preimage of the elements smaller than C and the preimage of the subset of elements larger than C . (Contributed by Glauco Siliprandi, 21-Dec-2024)

Ref Expression
Hypotheses pimxrneun.1 ⊢ Ⅎ x φ
pimxrneun.2 ⊢ φ ∧ x ∈ A → B ∈ ℝ *
pimxrneun.3 ⊢ φ ∧ x ∈ A → C ∈ ℝ *
Assertion pimxrneun ⊢ φ → x ∈ A | B ≠ C = x ∈ A | B < C ∪ x ∈ A | C < B

Proof

Step Hyp Ref Expression
1 pimxrneun.1 ⊢ Ⅎ x φ
2 pimxrneun.2 ⊢ φ ∧ x ∈ A → B ∈ ℝ *
3 pimxrneun.3 ⊢ φ ∧ x ∈ A → C ∈ ℝ *
4 nfrab1 ⊢ Ⅎ _ x x ∈ A | B < C
5 nfrab1 ⊢ Ⅎ _ x x ∈ A | C < B
6 4 5 nfun ⊢ Ⅎ _ x x ∈ A | B < C ∪ x ∈ A | C < B
7 simpl ⊢ x ∈ A ∧ B < C → x ∈ A
8 simpr ⊢ x ∈ A ∧ B < C → B < C
9 7 8 jca ⊢ x ∈ A ∧ B < C → x ∈ A ∧ B < C
10 rabid ⊢ x ∈ x ∈ A | B < C ↔ x ∈ A ∧ B < C
11 9 10 sylibr ⊢ x ∈ A ∧ B < C → x ∈ x ∈ A | B < C
12 11 adantll ⊢ φ ∧ x ∈ A ∧ B < C → x ∈ x ∈ A | B < C
13 elun1 ⊢ x ∈ x ∈ A | B < C → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
14 12 13 syl ⊢ φ ∧ x ∈ A ∧ B < C → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
15 14 3adantl3 ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ B < C → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
16 3simpa ⊢ φ ∧ x ∈ A ∧ B ≠ C → φ ∧ x ∈ A
17 16 adantr ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → φ ∧ x ∈ A
18 3 adantr ⊢ φ ∧ x ∈ A ∧ ¬ B < C → C ∈ ℝ *
19 18 3adantl3 ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → C ∈ ℝ *
20 2 adantr ⊢ φ ∧ x ∈ A ∧ ¬ B < C → B ∈ ℝ *
21 20 3adantl3 ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → B ∈ ℝ *
22 simpr ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → ¬ B < C
23 19 21 22 xrnltled ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → C ≤ B
24 necom ⊢ B ≠ C ↔ C ≠ B
25 24 birani ⊢ B ≠ C ∧ ¬ B < C → C ≠ B
26 25 3ad2antl3 ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → C ≠ B
27 19 21 23 26 xrleneltd ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → C < B
28 id ⊢ x ∈ A ∧ C < B → x ∈ A ∧ C < B
29 28 adantll ⊢ φ ∧ x ∈ A ∧ C < B → x ∈ A ∧ C < B
30 rabid ⊢ x ∈ x ∈ A | C < B ↔ x ∈ A ∧ C < B
31 29 30 sylibr ⊢ φ ∧ x ∈ A ∧ C < B → x ∈ x ∈ A | C < B
32 elun2 ⊢ x ∈ x ∈ A | C < B → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
33 31 32 syl ⊢ φ ∧ x ∈ A ∧ C < B → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
34 17 27 33 syl2anc ⊢ φ ∧ x ∈ A ∧ B ≠ C ∧ ¬ B < C → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
35 15 34 pm2.61dan ⊢ φ ∧ x ∈ A ∧ B ≠ C → x ∈ x ∈ A | B < C ∪ x ∈ A | C < B
36 1 6 35 rabssd ⊢ φ → x ∈ A | B ≠ C ⊆ x ∈ A | B < C ∪ x ∈ A | C < B
37 2 adantr ⊢ φ ∧ x ∈ A ∧ B < C → B ∈ ℝ *
38 3 adantr ⊢ φ ∧ x ∈ A ∧ B < C → C ∈ ℝ *
39 simpr ⊢ φ ∧ x ∈ A ∧ B < C → B < C
40 37 38 39 xrltned ⊢ φ ∧ x ∈ A ∧ B < C → B ≠ C
41 40 ex ⊢ φ ∧ x ∈ A → B < C → B ≠ C
42 1 41 ss2rabdf ⊢ φ → x ∈ A | B < C ⊆ x ∈ A | B ≠ C
43 3 adantr ⊢ φ ∧ x ∈ A ∧ C < B → C ∈ ℝ *
44 2 adantr ⊢ φ ∧ x ∈ A ∧ C < B → B ∈ ℝ *
45 simpr ⊢ φ ∧ x ∈ A ∧ C < B → C < B
46 43 44 45 xrgtned ⊢ φ ∧ x ∈ A ∧ C < B → B ≠ C
47 46 ex ⊢ φ ∧ x ∈ A → C < B → B ≠ C
48 1 47 ss2rabdf ⊢ φ → x ∈ A | C < B ⊆ x ∈ A | B ≠ C
49 42 48 unssd ⊢ φ → x ∈ A | B < C ∪ x ∈ A | C < B ⊆ x ∈ A | B ≠ C
50 36 49 eqssd ⊢ φ → x ∈ A | B ≠ C = x ∈ A | B < C ∪ x ∈ A | C < B