Theorem pimgtpnf2f 47714

Description: Given a real-valued function, the preimage of an open interval, unbounded above, with lower bound +∞, is the empty set. (Contributed by Glauco Siliprandi, 15-Dec-2021.)

Hypotheses

Ref	Expression
pimgtpnf2f.1	⊢ Ⅎ𝑥𝐹
pimgtpnf2f.2	⊢ Ⅎ𝑥𝐴
pimgtpnf2f.3	⊢ (𝜑 → 𝐹:𝐴⟶ℝ)

Assertion

Ref	Expression
pimgtpnf2f	⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑥)} = ∅)

Proof of Theorem pimgtpnf2f

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pimgtpnf2f.2	. . 3 ⊢ Ⅎ𝑥𝐴
2		nfcv 2923	. . 3 ⊢ Ⅎ𝑦𝐴
3		nfv 1947	. . 3 ⊢ Ⅎ𝑦+∞ < (𝐹‘𝑥)
4		nfcv 2923	. . . 4 ⊢ Ⅎ𝑥+∞
5		nfcv 2923	. . . 4 ⊢ Ⅎ𝑥 <
6		pimgtpnf2f.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
7		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝑦
8	6, 7	nffv 6895	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦)
9	4, 5, 8	nfbr 5152	. . 3 ⊢ Ⅎ𝑥+∞ < (𝐹‘𝑦)
10		fveq2 6885	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
11	10	breq2d 5115	. . 3 ⊢ (𝑥 = 𝑦 → (+∞ < (𝐹‘𝑥) ↔ +∞ < (𝐹‘𝑦)))
12	1, 2, 3, 9, 11	cbvrabw 3447	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑥)} = {𝑦 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑦)}
13		pimgtpnf2f.3	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
14	13	ffvelcdmda 7084	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ)
15	14	rexrd 11359	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ*)
16	15	pnfged 13260	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ≤ +∞)
17		pnfxr 11363	. . . . . . 7 ⊢ +∞ ∈ ℝ*
18	17	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → +∞ ∈ ℝ*)
19	15, 18	xrlenltd 11375	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝐹‘𝑦) ≤ +∞ ↔ ¬ +∞ < (𝐹‘𝑦)))
20	16, 19	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ¬ +∞ < (𝐹‘𝑦))
21	20	ralrimiva 3155	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ¬ +∞ < (𝐹‘𝑦))
22		rabeq0 4338	. . 3 ⊢ ({𝑦 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑦)} = ∅ ↔ ∀𝑦 ∈ 𝐴 ¬ +∞ < (𝐹‘𝑦))
23	21, 22	sylibr 237	. 2 ⊢ (𝜑 → {𝑦 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑦)} = ∅)
24	12, 23	eqtrid 2808	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑥)} = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908  ∀wral 3077  {crab 3413  ∅c0 4279   class class class wbr 5103  ⟶wf 6534  ‘cfv 6538  ℝcr 11199  +∞cpnf 11340  ℝ^*cxr 11342   < clt 11343   ≤ cle 11344

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-cnex 11256  ax-resscn 11257

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349

This theorem is used by:  pimgtpnf2  47715  smfpimgtxr  47789