Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pimgtmnf2 Structured version   Visualization version   GIF version

Theorem pimgtmnf2 47927
Description: Given a real-valued function, the preimage of an open interval, unbounded above, with lower bound -∞, is the whole domain. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
pimgtmnf2.1 Ⅎ𝑥𝐹
pimgtmnf2.2 (𝜑 → 𝐹:𝐴⟶ℝ)
Assertion
Ref Expression
pimgtmnf2 (𝜑 → {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)} = 𝐴)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐹(𝑥)

Proof of Theorem pimgtmnf2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssrab2 4008 . . 3 {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)} ⊆ 𝐴
21a1i 11 . 2 (𝜑 → {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)} ⊆ 𝐴)
3 ssid 3935 . . . . 5 𝐴 ⊆ 𝐴
43a1i 11 . . . 4 (𝜑 → 𝐴 ⊆ 𝐴)
5 pimgtmnf2.2 . . . . . . . 8 (𝜑 → 𝐹:𝐴⟶ℝ)
65ffvelcdmda 7105 . . . . . . 7 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) ∈ ℝ)
76mnfltd 13277 . . . . . 6 ((𝜑 ∧ 𝑦 ∈ 𝐴) → -∞ < (𝐹‘𝑦))
87ralrimiva 3158 . . . . 5 (𝜑 → ∀𝑦 ∈ 𝐴 -∞ < (𝐹‘𝑦))
9 nfcv 2926 . . . . . . 7 Ⅎ𝑥-∞
10 nfcv 2926 . . . . . . 7 Ⅎ𝑥 <
11 pimgtmnf2.1 . . . . . . . 8 Ⅎ𝑥𝐹
12 nfcv 2926 . . . . . . . 8 Ⅎ𝑥𝑦
1311, 12nffv 6915 . . . . . . 7 Ⅎ𝑥(𝐹‘𝑦)
149, 10, 13nfbr 5155 . . . . . 6 Ⅎ𝑥-∞ < (𝐹‘𝑦)
15 nfv 1949 . . . . . 6 Ⅎ𝑦-∞ < (𝐹‘𝑥)
16 fveq2 6905 . . . . . . 7 (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
1716breq2d 5118 . . . . . 6 (𝑦 = 𝑥 → (-∞ < (𝐹‘𝑦) ↔ -∞ < (𝐹‘𝑥)))
1814, 15, 17cbvralw 3308 . . . . 5 (∀𝑦 ∈ 𝐴 -∞ < (𝐹‘𝑦) ↔ ∀𝑥 ∈ 𝐴 -∞ < (𝐹‘𝑥))
198, 18sylib 221 . . . 4 (𝜑 → ∀𝑥 ∈ 𝐴 -∞ < (𝐹‘𝑥))
204, 19jca 521 . . 3 (𝜑 → (𝐴 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 -∞ < (𝐹‘𝑥)))
21 nfcv 2926 . . . 4 Ⅎ𝑥𝐴
2221, 21ssrabf 46332 . . 3 (𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)} ↔ (𝐴 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝐴 -∞ < (𝐹‘𝑥)))
2320, 22sylibr 237 . 2 (𝜑 → 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)})
242, 23eqssd 3930 1 (𝜑 → {𝑥 ∈ 𝐴 ∣ -∞ < (𝐹‘𝑥)} = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080  {crab 3416   ⊆ wss 3900   class class class wbr 5106  ⟶wf 6551  ‘cfv 6555  ℝcr 11223  -∞cmnf 11365   < clt 11367
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator