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 39650
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 1843 . 2 𝑦𝜑
2 nfv 1843 . 2 𝑧𝜑
3 infrnmptle.x . . 3 𝑥𝜑
4 eqid 2622 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
5 infrnmptle.b . . 3 ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)
63, 4, 5rnmptssd 39385 . 2 (𝜑 → ran (𝑥𝐴𝐵) ⊆ ℝ*)
7 eqid 2622 . . 3 (𝑥𝐴𝐶) = (𝑥𝐴𝐶)
8 infrnmptle.c . . 3 ((𝜑𝑥𝐴) → 𝐶 ∈ ℝ*)
93, 7, 8rnmptssd 39385 . 2 (𝜑 → ran (𝑥𝐴𝐶) ⊆ ℝ*)
10 vex 3203 . . . . . 6 𝑦 ∈ V
117elrnmpt 5372 . . . . . 6 (𝑦 ∈ V → (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶))
1210, 11ax-mp 5 . . . . 5 (𝑦 ∈ ran (𝑥𝐴𝐶) ↔ ∃𝑥𝐴 𝑦 = 𝐶)
1312biimpi 206 . . . 4 (𝑦 ∈ ran (𝑥𝐴𝐶) → ∃𝑥𝐴 𝑦 = 𝐶)
1413adantl 482 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑥𝐴 𝑦 = 𝐶)
15 nfmpt1 4747 . . . . . . 7 𝑥(𝑥𝐴𝐵)
1615nfrn 5368 . . . . . 6 𝑥ran (𝑥𝐴𝐵)
17 nfv 1843 . . . . . 6 𝑥 𝑧𝑦
1816, 17nfrex 3007 . . . . 5 𝑥𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦
19 simpr 477 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐴)
204elrnmpt1 5374 . . . . . . . . 9 ((𝑥𝐴𝐵 ∈ ℝ*) → 𝐵 ∈ ran (𝑥𝐴𝐵))
2119, 5, 20syl2anc 693 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐵 ∈ ran (𝑥𝐴𝐵))
22213adant3 1081 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵 ∈ ran (𝑥𝐴𝐵))
23 infrnmptle.l . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐵𝐶)
24233adant3 1081 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝐶)
25 id 22 . . . . . . . . . 10 (𝑦 = 𝐶𝑦 = 𝐶)
2625eqcomd 2628 . . . . . . . . 9 (𝑦 = 𝐶𝐶 = 𝑦)
27263ad2ant3 1084 . . . . . . . 8 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐶 = 𝑦)
2824, 27breqtrd 4679 . . . . . . 7 ((𝜑𝑥𝐴𝑦 = 𝐶) → 𝐵𝑦)
29 breq1 4656 . . . . . . . 8 (𝑧 = 𝐵 → (𝑧𝑦𝐵𝑦))
3029rspcev 3309 . . . . . . 7 ((𝐵 ∈ ran (𝑥𝐴𝐵) ∧ 𝐵𝑦) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
3122, 28, 30syl2anc 693 . . . . . 6 ((𝜑𝑥𝐴𝑦 = 𝐶) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
32313exp 1264 . . . . 5 (𝜑 → (𝑥𝐴 → (𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)))
333, 18, 32rexlimd 3026 . . . 4 (𝜑 → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3433adantr 481 . . 3 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → (∃𝑥𝐴 𝑦 = 𝐶 → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦))
3514, 34mpd 15 . 2 ((𝜑𝑦 ∈ ran (𝑥𝐴𝐶)) → ∃𝑧 ∈ ran (𝑥𝐴𝐵)𝑧𝑦)
361, 2, 6, 9, 35infleinf2 39641 1 (𝜑 → inf(ran (𝑥𝐴𝐵), ℝ*, < ) ≤ inf(ran (𝑥𝐴𝐶), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wnf 1708  wcel 1990  wrex 2913  Vcvv 3200   class class class wbr 4653  cmpt 4729  ran crn 5115  infcinf 8347  *cxr 10073   < clt 10074  cle 10075
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-sup 8348  df-inf 8349  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269
This theorem is referenced by:  limsupres  39937
  Copyright terms: Public domain W3C validator