| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fsupdm2 | Structured version Visualization version GIF version | ||
| Description: The domain of the sup function is defined in Proposition 121F (b) of [Fremlin1], p. 38. Note that this definition of the sup function is quite general, as it does not require the original functions to be sigma-measurable, and it could be applied to uncountable sets of functions. The equality proved here is part of the proof of the fourth statement of Proposition 121H in [Fremlin1], p. 39. (Contributed by Glauco Siliprandi, 24-Jan-2025.) |
| Ref | Expression |
|---|---|
| fsupdm2.1 | ⊢ Ⅎ𝑛𝜑 |
| fsupdm2.2 | ⊢ Ⅎ𝑥𝜑 |
| fsupdm2.3 | ⊢ Ⅎ𝑚𝜑 |
| fsupdm2.4 | ⊢ Ⅎ𝑥𝐹 |
| fsupdm2.5 | ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ*) |
| fsupdm2.6 | ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 ((𝐹‘𝑛)‘𝑥) ≤ 𝑦} |
| fsupdm2.7 | ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )) |
| fsupdm2.8 | ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚})) |
| Ref | Expression |
|---|---|
| fsupdm2 | ⊢ (𝜑 → dom 𝐺 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fsupdm2.2 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | fsupdm2.6 | . . . 4 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 ((𝐹‘𝑛)‘𝑥) ≤ 𝑦} | |
| 3 | nfrab1 3435 | . . . 4 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 ((𝐹‘𝑛)‘𝑥) ≤ 𝑦} | |
| 4 | 2, 3 | nfcxfr 2924 | . . 3 ⊢ Ⅎ𝑥𝐷 |
| 5 | fsupdm2.7 | . . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )) | |
| 6 | ltso 11429 | . . . . 5 ⊢ < Or ℝ | |
| 7 | 6 | supex 9493 | . . . 4 ⊢ sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ) ∈ V |
| 8 | 7 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → sup(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ) ∈ V) |
| 9 | 1, 4, 5, 8 | dmmptdff 46509 | . 2 ⊢ (𝜑 → dom 𝐺 = 𝐷) |
| 10 | fsupdm2.1 | . . 3 ⊢ Ⅎ𝑛𝜑 | |
| 11 | fsupdm2.3 | . . 3 ⊢ Ⅎ𝑚𝜑 | |
| 12 | fsupdm2.4 | . . 3 ⊢ Ⅎ𝑥𝐹 | |
| 13 | fsupdm2.5 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ*) | |
| 14 | fsupdm2.8 | . . 3 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑚 ∈ ℕ ↦ {𝑥 ∈ dom (𝐹‘𝑛) ∣ ((𝐹‘𝑛)‘𝑥) < 𝑚})) | |
| 15 | 10, 1, 11, 12, 13, 2, 14 | fsupdm 48125 | . 2 ⊢ (𝜑 → 𝐷 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) |
| 16 | 9, 15 | eqtrd 2798 | 1 ⊢ (𝜑 → dom 𝐺 = ∪ 𝑚 ∈ ℕ ∩ 𝑛 ∈ 𝑍 ((𝐻‘𝑛)‘𝑚)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 Ⅎwnfc 2911 ∀wral 3080 ∃wrex 3090 {crab 3416 Vcvv 3454 ∪ ciun 4956 ∩ ciin 4957 class class class wbr 5108 ↦ cmpt 5192 dom cdm 5658 ran crn 5659 ⟶wf 6562 ‘cfv 6566 supcsup 9469 ℝcr 11238 ℝ*cxr 11381 < clt 11382 ≤ cle 11383 ℕcn 12375 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 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 4841 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 |
| This theorem is used by: smfsupdmmbllem 48127 |
| Copyright terms: Public domain | W3C validator |