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 46022
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 1941 . 2 𝑦𝜑
2 nfv 1941 . 2 𝑧𝜑
3 infrnmptle.x . . 3 𝑥𝜑
4 eqid 2769 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
5 infrnmptle.b . . 3 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
63, 4, 5rnmptssd 7117 . 2 (𝜑 → ran (𝑥𝐴𝐵) ⊆ ℝ*)
7 eqid 2769 . . 3 (𝑥𝐴𝐶) = (𝑥𝐴𝐶)
8 infrnmptle.c . . 3 ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ*)
93, 7, 8rnmptssd 7117 . 2 (𝜑 → ran (𝑥𝐴𝐶) ⊆ ℝ*)
10 vex 3467 . . . . 5 𝑦 ∈ V
117elrnmpt 5946 . . . . 5 (𝑦 ∈ V → (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶))
1210, 11ax-mp 5 . . . 4 (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶)
1312bilani 509 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑥𝐴 𝑦 = 𝐶)
14 nfmpt1 5211 . . . . . . 7 𝑥(𝑥𝐴𝐵)
1514nfrn 5940 . . . . . 6 𝑥ran (𝑥𝐴𝐵)
16 nfv 1941 . . . . . 6 𝑥 𝑧𝑦
1715, 16nfrexw 3319 . . . . 5 𝑥𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦
18 simpr 489 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐴)
194elrnmpt1 5948 . . . . . . . . 9 ((𝑥𝐴𝐵 ∈ ℝ*) → 𝐵 ∈ ran (𝑥𝐴𝐵))
2018, 5, 19syl2anc 595 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐵 ∈ ran (𝑥𝐴𝐵))
21203adant3 1148 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵 ∈ ran (𝑥𝐴𝐵))
22 infrnmptle.l . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐵𝐶)
23223adant3 1148 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝐶)
24 id 23 . . . . . . . . . 10 (𝑦 = 𝐶𝑦 = 𝐶)
2524eqcomd 2775 . . . . . . . . 9 (𝑦 = 𝐶𝐶 = 𝑦)
26253ad2ant3 1151 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐶 = 𝑦)
2723, 26breqtrd 5138 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝑦)
28 breq1 5113 . . . . . . . 8 (𝑧 = 𝐵 → (𝑧𝑦𝐵𝑦))
2928rspcev 3590 . . . . . . 7 ((𝐵 ∈ ran (𝑥𝐴𝐵) ∧ 𝐵𝑦) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
3021, 27, 29syl2anc 595 . . . . . 6 ((𝜑𝑥𝐴𝑦 = 𝐶) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
31303exp 1135 . . . . 5 (𝜑 → (𝑥𝐴 → (𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)))
323, 17, 31rexlimd 3278 . . . 4 (𝜑 → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3332adantr 485 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3413, 33mpd 16 . 2 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
351, 2, 6, 9, 34infleinf2 46013 1 (𝜑 → inf(ran (𝑥𝐴𝐵), ℝ*, < ) ≤ inf(ran (𝑥𝐴𝐶), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wnf 1810  wcel 2149  wrex 3095  Vcvv 3463   class class class wbr 5110  cmpt 5193  ran crn 5660  infcinf 9397  *cxr 11238   < clt 11239  cle 11240
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173  ax-pre-sup 11174
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-inf 9399  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440
This theorem is referenced by:  limsupres  46304
  Copyright terms: Public domain W3C validator