Theorem rnmptlb 44245

Description: Boundness below of the range of a function in maps-to notation. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypothesis

Ref	Expression
rnmptlb.1	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵)

Assertion

Ref	Expression
rnmptlb	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)

Distinct variable groups:   𝑦,𝐴,𝑧   𝑦,𝐵,𝑧   𝜑,𝑧   𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem rnmptlb

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2730	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
2	1	elrnmpt 5954	. . . . . 6 ⊢ (𝑧 ∈ V → (𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵))
3	2	elv 3478	. . . . 5 ⊢ (𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵)
4		nfra1 3279	. . . . . . . 8 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵
5		nfv 1915	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑤 ≤ 𝑧
6		rspa 3243	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑤 ≤ 𝐵)
7	6	3adant3 1130	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝑤 ≤ 𝐵)
8		simp3 1136	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝑧 = 𝐵)
9	7, 8	breqtrrd 5175	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑧 = 𝐵) → 𝑤 ≤ 𝑧)
10	9	3exp 1117	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 → (𝑥 ∈ 𝐴 → (𝑧 = 𝐵 → 𝑤 ≤ 𝑧)))
11	4, 5, 10	rexlimd 3261	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 → (∃𝑥 ∈ 𝐴 𝑧 = 𝐵 → 𝑤 ≤ 𝑧))
12	11	imp 405	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → 𝑤 ≤ 𝑧)
13	12	adantll 710	. . . . 5 ⊢ ((((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵) ∧ ∃𝑥 ∈ 𝐴 𝑧 = 𝐵) → 𝑤 ≤ 𝑧)
14	3, 13	sylan2b 592	. . . 4 ⊢ ((((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵) ∧ 𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) → 𝑤 ≤ 𝑧)
15	14	ralrimiva 3144	. . 3 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ) ∧ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵) → ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑧)
16		rnmptlb.1	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵)
17		breq1 5150	. . . . . 6 ⊢ (𝑦 = 𝑤 → (𝑦 ≤ 𝐵 ↔ 𝑤 ≤ 𝐵))
18	17	ralbidv 3175	. . . . 5 ⊢ (𝑦 = 𝑤 → (∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵))
19	18	cbvrexvw 3233	. . . 4 ⊢ (∃𝑦 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑦 ≤ 𝐵 ↔ ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵)
20	16, 19	sylib 217	. . 3 ⊢ (𝜑 → ∃𝑤 ∈ ℝ ∀𝑥 ∈ 𝐴 𝑤 ≤ 𝐵)
21	15, 20	reximddv3 44141	. 2 ⊢ (𝜑 → ∃𝑤 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑧)
22		breq1 5150	. . . 4 ⊢ (𝑤 = 𝑦 → (𝑤 ≤ 𝑧 ↔ 𝑦 ≤ 𝑧))
23	22	ralbidv 3175	. . 3 ⊢ (𝑤 = 𝑦 → (∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑧 ↔ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧))
24	23	cbvrexvw 3233	. 2 ⊢ (∃𝑤 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑤 ≤ 𝑧 ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)
25	21, 24	sylib 217	1 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑥 ∈ 𝐴 ↦ 𝐵)𝑦 ≤ 𝑧)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1085   = wceq 1539   ∈ wcel 2104  ∀wral 3059  ∃wrex 3068  Vcvv 3472   class class class wbr 5147   ↦ cmpt 5230  ran crn 5676  ℝcr 11111   ≤ cle 11253

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-br 5148  df-opab 5210  df-mpt 5231  df-cnv 5683  df-dm 5685  df-rn 5686

This theorem is referenced by:  infnsuprnmpt  44252  infrpgernmpt  44473