| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > smfpimne2 | Structured version Visualization version GIF version | ||
| Description: Given a function measurable w.r.t. to a sigma-algebra, the preimage of reals that are different from a value is in the subspace sigma-algebra induced by its domain. Notice that 𝐴 is not assumed to be an extended real. (Contributed by Glauco Siliprandi, 5-Jan-2025.) |
| Ref | Expression |
|---|---|
| smfpimne2.p | ⊢ Ⅎ𝑥𝜑 |
| smfpimne2.x | ⊢ Ⅎ𝑥𝐹 |
| smfpimne2.s | ⊢ (𝜑 → 𝑆 ∈ SAlg) |
| smfpimne2.f | ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) |
| smfpimne2.d | ⊢ 𝐷 = dom 𝐹 |
| Ref | Expression |
|---|---|
| smfpimne2 | ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ∈ (𝑆 ↾t 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | smfpimne2.p | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
| 2 | nfv 1949 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ ℝ* | |
| 3 | 1, 2 | nfan 1934 | . . 3 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐴 ∈ ℝ*) |
| 4 | smfpimne2.x | . . 3 ⊢ Ⅎ𝑥𝐹 | |
| 5 | smfpimne2.s | . . . 4 ⊢ (𝜑 → 𝑆 ∈ SAlg) | |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ*) → 𝑆 ∈ SAlg) |
| 7 | smfpimne2.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (SMblFn‘𝑆)) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ*) → 𝐹 ∈ (SMblFn‘𝑆)) |
| 9 | smfpimne2.d | . . 3 ⊢ 𝐷 = dom 𝐹 | |
| 10 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ*) → 𝐴 ∈ ℝ*) | |
| 11 | 3, 4, 6, 8, 9, 10 | smfpimne 48054 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ ℝ*) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ∈ (𝑆 ↾t 𝐷)) |
| 12 | 4 | nfdm 5940 | . . . . . . 7 ⊢ Ⅎ𝑥dom 𝐹 |
| 13 | 9, 12 | nfcxfr 2924 | . . . . . 6 ⊢ Ⅎ𝑥𝐷 |
| 14 | 13 | ssrab2f 46337 | . . . . 5 ⊢ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ⊆ 𝐷 |
| 15 | 14 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ⊆ 𝐷) |
| 16 | nfv 1949 | . . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝐴 ∈ ℝ* | |
| 17 | 1, 16 | nfan 1934 | . . . . 5 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ 𝐴 ∈ ℝ*) |
| 18 | ssidd 3936 | . . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → 𝐷 ⊆ 𝐷) | |
| 19 | nne 2963 | . . . . . . . 8 ⊢ (¬ (𝐹‘𝑥) ≠ 𝐴 ↔ (𝐹‘𝑥) = 𝐴) | |
| 20 | simpr 490 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐹‘𝑥) = 𝐴) → (𝐹‘𝑥) = 𝐴) | |
| 21 | 5, 7, 9 | smff 47947 | . . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝐷⟶ℝ) |
| 22 | 21 | ffvelcdmda 7108 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ∈ ℝ) |
| 23 | 22 | rexrd 11386 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ∈ ℝ*) |
| 24 | 23 | adantr 486 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐹‘𝑥) = 𝐴) → (𝐹‘𝑥) ∈ ℝ*) |
| 25 | 20, 24 | eqeltrrd 2865 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ (𝐹‘𝑥) = 𝐴) → 𝐴 ∈ ℝ*) |
| 26 | 19, 25 | sylan2b 606 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ ¬ (𝐹‘𝑥) ≠ 𝐴) → 𝐴 ∈ ℝ*) |
| 27 | 26 | adantllr 732 | . . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) ∧ 𝑥 ∈ 𝐷) ∧ ¬ (𝐹‘𝑥) ≠ 𝐴) → 𝐴 ∈ ℝ*) |
| 28 | simpllr 788 | . . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) ∧ 𝑥 ∈ 𝐷) ∧ ¬ (𝐹‘𝑥) ≠ 𝐴) → ¬ 𝐴 ∈ ℝ*) | |
| 29 | 27, 28 | condan 830 | . . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) ∧ 𝑥 ∈ 𝐷) → (𝐹‘𝑥) ≠ 𝐴) |
| 30 | 13, 13, 17, 18, 29 | ssrabdf 46335 | . . . 4 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → 𝐷 ⊆ {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴}) |
| 31 | 15, 30 | eqssd 3930 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} = 𝐷) |
| 32 | 5, 7, 9 | smfdmss 47948 | . . . . 5 ⊢ (𝜑 → 𝐷 ⊆ ∪ 𝑆) |
| 33 | 5, 32 | subsaluni 47575 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ (𝑆 ↾t 𝐷)) |
| 34 | 33 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → 𝐷 ∈ (𝑆 ↾t 𝐷)) |
| 35 | 31, 34 | eqeltrd 2864 | . 2 ⊢ ((𝜑 ∧ ¬ 𝐴 ∈ ℝ*) → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ∈ (𝑆 ↾t 𝐷)) |
| 36 | 11, 35 | pm2.61dan 825 | 1 ⊢ (𝜑 → {𝑥 ∈ 𝐷 ∣ (𝐹‘𝑥) ≠ 𝐴} ∈ (𝑆 ↾t 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 Ⅎwnfc 2911 ≠ wne 2959 {crab 3416 ⊆ wss 3900 dom cdm 5655 ‘cfv 6558 (class class class)co 7443 ℝcr 11226 ℝ*cxr 11369 ↾t crest 17620 SAlgcsalg 47523 SMblFncsmblfn 47910 |
| 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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-inf2 9669 ax-cc 10540 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305 |
| 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 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-isom 6567 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-er 8745 df-map 8877 df-pm 8878 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-sup 9461 df-inf 9462 df-card 10047 df-acn 10050 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-n0 12634 df-z 12721 df-uz 12993 df-q 13103 df-rp 13148 df-ioo 13507 df-ico 13509 df-fl 13959 df-rest 17622 df-salg 47524 df-smblfn 47911 |
| This theorem is used by: smfdivdmmbl2 48056 |
| Copyright terms: Public domain | W3C validator |