Theorem isome 39384

Description: Express the predicate "𝑂 is an outer measure." Definition 113A of [Fremlin1] p. 19. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Assertion

Ref	Expression
isome	⊢ (𝑂 ∈ 𝑉 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))

Distinct variable group:   𝑦,𝑂,𝑧

Allowed substitution hints:   𝑉(𝑦,𝑧)

Proof of Theorem isome

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ome 39380	. . . 4 ⊢ OutMeas = {𝑥 ∣ ((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))))}
2	1	a1i 11	. . 3 ⊢ (𝑂 ∈ 𝑉 → OutMeas = {𝑥 ∣ ((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))))})
3	2	eleq2d 2673	. 2 ⊢ (𝑂 ∈ 𝑉 → (𝑂 ∈ OutMeas ↔ 𝑂 ∈ {𝑥 ∣ ((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))))}))
4		id 22	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → 𝑥 = 𝑂)
5		dmeq 5246	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → dom 𝑥 = dom 𝑂)
6	4, 5	feq12d 5946	. . . . . . 7 ⊢ (𝑥 = 𝑂 → (𝑥:dom 𝑥⟶(0[,]+∞) ↔ 𝑂:dom 𝑂⟶(0[,]+∞)))
7	5	unieqd 4382	. . . . . . . . 9 ⊢ (𝑥 = 𝑂 → ∪ dom 𝑥 = ∪ dom 𝑂)
8	7	pweqd 4113	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → 𝒫 ∪ dom 𝑥 = 𝒫 ∪ dom 𝑂)
9	5, 8	eqeq12d 2625	. . . . . . 7 ⊢ (𝑥 = 𝑂 → (dom 𝑥 = 𝒫 ∪ dom 𝑥 ↔ dom 𝑂 = 𝒫 ∪ dom 𝑂))
10	6, 9	anbi12d 743	. . . . . 6 ⊢ (𝑥 = 𝑂 → ((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ↔ (𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂)))
11		fveq1 6102	. . . . . . 7 ⊢ (𝑥 = 𝑂 → (𝑥‘∅) = (𝑂‘∅))
12	11	eqeq1d 2612	. . . . . 6 ⊢ (𝑥 = 𝑂 → ((𝑥‘∅) = 0 ↔ (𝑂‘∅) = 0))
13	10, 12	anbi12d 743	. . . . 5 ⊢ (𝑥 = 𝑂 → (((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ↔ ((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0)))
14	8	raleqdv 3121	. . . . . 6 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦) ↔ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)))
15		fveq1 6102	. . . . . . . . 9 ⊢ (𝑥 = 𝑂 → (𝑥‘𝑧) = (𝑂‘𝑧))
16		fveq1 6102	. . . . . . . . 9 ⊢ (𝑥 = 𝑂 → (𝑥‘𝑦) = (𝑂‘𝑦))
17	15, 16	breq12d 4596	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → ((𝑥‘𝑧) ≤ (𝑥‘𝑦) ↔ (𝑂‘𝑧) ≤ (𝑂‘𝑦)))
18	17	ralbidv 2969	. . . . . . 7 ⊢ (𝑥 = 𝑂 → (∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦) ↔ ∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)))
19	18	ralbidv 2969	. . . . . 6 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦) ↔ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)))
20	14, 19	bitrd 267	. . . . 5 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦) ↔ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)))
21	13, 20	anbi12d 743	. . . 4 ⊢ (𝑥 = 𝑂 → ((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ↔ (((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦))))
22	5	pweqd 4113	. . . . . 6 ⊢ (𝑥 = 𝑂 → 𝒫 dom 𝑥 = 𝒫 dom 𝑂)
23	22	raleqdv 3121	. . . . 5 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))) ↔ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦)))))
24		fveq1 6102	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → (𝑥‘∪ 𝑦) = (𝑂‘∪ 𝑦))
25		reseq1 5311	. . . . . . . . 9 ⊢ (𝑥 = 𝑂 → (𝑥 ↾ 𝑦) = (𝑂 ↾ 𝑦))
26	25	fveq2d 6107	. . . . . . . 8 ⊢ (𝑥 = 𝑂 → (Σ^‘(𝑥 ↾ 𝑦)) = (Σ^‘(𝑂 ↾ 𝑦)))
27	24, 26	breq12d 4596	. . . . . . 7 ⊢ (𝑥 = 𝑂 → ((𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦)) ↔ (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))
28	27	imbi2d 329	. . . . . 6 ⊢ (𝑥 = 𝑂 → ((𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))) ↔ (𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))))
29	28	ralbidv 2969	. . . . 5 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))) ↔ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))))
30	23, 29	bitrd 267	. . . 4 ⊢ (𝑥 = 𝑂 → (∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))) ↔ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦)))))
31	21, 30	anbi12d 743	. . 3 ⊢ (𝑥 = 𝑂 → (((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦)))) ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
32	31	elabg 3320	. 2 ⊢ (𝑂 ∈ 𝑉 → (𝑂 ∈ {𝑥 ∣ ((((𝑥:dom 𝑥⟶(0[,]+∞) ∧ dom 𝑥 = 𝒫 ∪ dom 𝑥) ∧ (𝑥‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑥∀𝑧 ∈ 𝒫 𝑦(𝑥‘𝑧) ≤ (𝑥‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑥(𝑦 ≼ ω → (𝑥‘∪ 𝑦) ≤ (Σ^‘(𝑥 ↾ 𝑦))))} ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))
33	3, 32	bitrd 267	1 ⊢ (𝑂 ∈ 𝑉 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑦 ∈ 𝒫 ∪ dom 𝑂∀𝑧 ∈ 𝒫 𝑦(𝑂‘𝑧) ≤ (𝑂‘𝑦)) ∧ ∀𝑦 ∈ 𝒫 dom 𝑂(𝑦 ≼ ω → (𝑂‘∪ 𝑦) ≤ (Σ^‘(𝑂 ↾ 𝑦))))))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  ∀wral 2896  ∅c0 3874  𝒫 cpw 4108  ∪ cuni 4372   class class class wbr 4583  dom cdm 5038   ↾ cres 5040  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  ωcom 6957   ≼ cdom 7839  0cc0 9815  +∞cpnf 9950   ≤ cle 9954  [,]cicc 12049  Σ^{^}csumge0 39255  OutMeascome 39379

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ome 39380

This theorem is referenced by:  omef  39386  ome0  39387  omessle  39388  omedm  39389  omeunile  39395  0ome  39419  isomennd  39421