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

Theorem infrnmptle 46170
Description: An indexed infimum of extended reals is smaller than another indexed infimum of extended reals, when every indexed element is smaller than the corresponding one. (Contributed by Glauco Siliprandi, 23-Oct-2021.)
Hypotheses
Ref Expression
infrnmptle.x 𝑥𝜑
infrnmptle.b ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
infrnmptle.c ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ*)
infrnmptle.l ((𝜑𝑥𝐴) → 𝐵𝐶)
Assertion
Ref Expression
infrnmptle (𝜑 → inf(ran (𝑥𝐴𝐵), ℝ*, < ) ≤ inf(ran (𝑥𝐴𝐶), ℝ*, < ))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem infrnmptle
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1947 . 2 𝑦𝜑
2 nfv 1947 . 2 𝑧𝜑
3 infrnmptle.x . . 3 𝑥𝜑
4 eqid 2765 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
5 infrnmptle.b . . 3 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
63, 4, 5rnmptssd 7123 . 2 (𝜑 → ran (𝑥𝐴𝐵) ⊆ ℝ*)
7 eqid 2765 . . 3 (𝑥𝐴𝐶) = (𝑥𝐴𝐶)
8 infrnmptle.c . . 3 ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ*)
93, 7, 8rnmptssd 7123 . 2 (𝜑 → ran (𝑥𝐴𝐶) ⊆ ℝ*)
10 vex 3461 . . . . 5 𝑦 ∈ V
117elrnmpt 5950 . . . . 5 (𝑦 ∈ V → (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶))
1210, 11ax-mp 5 . . . 4 (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶)
1312bilani 510 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑥𝐴 𝑦 = 𝐶)
14 nfmpt1 5212 . . . . . . 7 𝑥(𝑥𝐴𝐵)
1514nfrn 5944 . . . . . 6 𝑥ran (𝑥𝐴𝐵)
16 nfv 1947 . . . . . 6 𝑥 𝑧𝑦
1715, 16nfrexw 3315 . . . . 5 𝑥𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦
18 simpr 490 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐴)
194elrnmpt1 5952 . . . . . . . . 9 ((𝑥𝐴𝐵 ∈ ℝ*) → 𝐵 ∈ ran (𝑥𝐴𝐵))
2018, 5, 19syl2anc 596 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐵 ∈ ran (𝑥𝐴𝐵))
21203adant3 1150 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵 ∈ ran (𝑥𝐴𝐵))
22 infrnmptle.l . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐵𝐶)
23223adant3 1150 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝐶)
24 id 23 . . . . . . . . . 10 (𝑦 = 𝐶𝑦 = 𝐶)
2524eqcomd 2771 . . . . . . . . 9 (𝑦 = 𝐶𝐶 = 𝑦)
26253ad2ant3 1153 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐶 = 𝑦)
2723, 26breqtrd 5139 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝑦)
28 breq1 5114 . . . . . . . 8 (𝑧 = 𝐵 → (𝑧𝑦𝐵𝑦))
2928rspcev 3583 . . . . . . 7 ((𝐵 ∈ ran (𝑥𝐴𝐵) ∧ 𝐵𝑦) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
3021, 27, 29syl2anc 596 . . . . . 6 ((𝜑𝑥𝐴𝑦 = 𝐶) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
31303exp 1137 . . . . 5 (𝜑 → (𝑥𝐴 → (𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)))
323, 17, 31rexlimd 3274 . . . 4 (𝜑 → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3332adantr 486 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3413, 33mpd 16 . 2 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
351, 2, 6, 9, 34infleinf2 46161 1 (𝜑 → inf(ran (𝑥𝐴𝐵), ℝ*, < ) ≤ inf(ran (𝑥𝐴𝐶), ℝ*, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wnf 1816  wcel 2146  wrex 3091  Vcvv 3457   class class class wbr 5111  cmpt 5194  ran crn 5664  infcinf 9404  *cxr 11253   < clt 11254  cle 11255
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188  ax-pre-sup 11189
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-po 5571  df-so 5572  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-sup 9405  df-inf 9406  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455
This theorem is used by:  limsupres  46452
  Copyright terms: Public domain W3C validator