Theorem pimgtpnf2 47448

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, 26-Jun-2021.) (Revised by Glauco Siliprandi, 15-Dec-2024.)

Hypotheses

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

Assertion

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

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐹(𝑥)

Proof of Theorem pimgtpnf2

Step	Hyp	Ref	Expression
1		pimgtpnf2.1	. 2 ⊢ Ⅎ𝑥𝐹
2		nfcv 2924	. 2 ⊢ Ⅎ𝑥𝐴
3		pimgtpnf2.2	. 2 ⊢ (𝜑 → 𝐹:𝐴⟶ℝ)
4	1, 2, 3	pimgtpnf2f 47447	1 ⊢ (𝜑 → {𝑥 ∈ 𝐴 ∣ +∞ < (𝐹‘𝑥)} = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569  Ⅎwnfc 2909  {crab 3415  ∅c0 4285   class class class wbr 5108  ⟶wf 6532  ‘cfv 6536  ℝcr 11105  +∞cpnf 11246   < clt 11249

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255

This theorem is used by: (None)