Theorem preimagelt 44190

Description: The preimage of a right-open, unbounded below interval, is the complement of a left-closed unbounded above interval. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
preimagelt.x	⊢ Ⅎ𝑥𝜑
preimagelt.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*)
preimagelt.c	⊢ (𝜑 → 𝐶 ∈ ℝ*)

Assertion

Ref	Expression
preimagelt	⊢ (𝜑 → (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) = {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶})

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem preimagelt

Step	Hyp	Ref	Expression
1		preimagelt.x	. 2 ⊢ Ⅎ𝑥𝜑
2		nfcv 2908	. . 3 ⊢ Ⅎ𝑥𝐴
3		nfrab1 3315	. . 3 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}
4	2, 3	nfdif 4064	. 2 ⊢ Ⅎ𝑥(𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})
5		nfrab1 3315	. 2 ⊢ Ⅎ𝑥{𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}
6		eldifi 4065	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) → 𝑥 ∈ 𝐴)
7	6	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → 𝑥 ∈ 𝐴)
8		eldifn 4066	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) → ¬ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})
9	6	anim1i 614	. . . . . . . 8 ⊢ ((𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) ∧ 𝐶 ≤ 𝐵) → (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝐵))
10		rabid 3308	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵} ↔ (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝐵))
11	9, 10	sylibr 233	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) ∧ 𝐶 ≤ 𝐵) → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})
12	8, 11	mtand 812	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) → ¬ 𝐶 ≤ 𝐵)
13	12	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → ¬ 𝐶 ≤ 𝐵)
14		preimagelt.b	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ*)
15	6, 14	sylan2 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → 𝐵 ∈ ℝ*)
16		preimagelt.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℝ*)
17	16	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → 𝐶 ∈ ℝ*)
18	15, 17	xrltnled 42856	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → (𝐵 < 𝐶 ↔ ¬ 𝐶 ≤ 𝐵))
19	13, 18	mpbird 256	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → 𝐵 < 𝐶)
20		rabid 3308	. . . 4 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶} ↔ (𝑥 ∈ 𝐴 ∧ 𝐵 < 𝐶))
21	7, 19, 20	sylanbrc 582	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})) → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶})
22		rabidim1 3310	. . . . 5 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶} → 𝑥 ∈ 𝐴)
23	22	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → 𝑥 ∈ 𝐴)
24		rabidim2 42605	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶} → 𝐵 < 𝐶)
25	24	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → 𝐵 < 𝐶)
26	22, 14	sylan2 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → 𝐵 ∈ ℝ*)
27	16	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → 𝐶 ∈ ℝ*)
28	26, 27	xrltnled 42856	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → (𝐵 < 𝐶 ↔ ¬ 𝐶 ≤ 𝐵))
29	25, 28	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → ¬ 𝐶 ≤ 𝐵)
30	29	intnand 488	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → ¬ (𝑥 ∈ 𝐴 ∧ 𝐶 ≤ 𝐵))
31	30, 10	sylnibr 328	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → ¬ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵})
32	23, 31	eldifd 3902	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}) → 𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}))
33	21, 32	impbida 797	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) ↔ 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶}))
34	1, 4, 5, 33	eqrd 3944	1 ⊢ (𝜑 → (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝐶 ≤ 𝐵}) = {𝑥 ∈ 𝐴 ∣ 𝐵 < 𝐶})

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541  Ⅎwnf 1789   ∈ wcel 2109  {crab 3069   ∖ cdif 3888   class class class wbr 5078  ℝ^*cxr 10992   < clt 10993   ≤ cle 10994

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-dif 3894  df-un 3896  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-br 5079  df-opab 5141  df-xp 5594  df-cnv 5596  df-le 10999

This theorem is referenced by:  salpreimagelt  44196