Theorem isomennd 43170

Description: Sufficient condition to prove that 𝑂 is an outer measure. Definition 113A of [Fremlin1] p. 19 . (Contributed by Glauco Siliprandi, 11-Oct-2020.)

Hypotheses

Ref	Expression
isomennd.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
isomennd.o	⊢ (𝜑 → 𝑂:𝒫 𝑋⟶(0[,]+∞))
isomennd.o0	⊢ (𝜑 → (𝑂‘∅) = 0)
isomennd.le	⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑋 ∧ 𝑦 ⊆ 𝑥) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
isomennd.sa	⊢ ((𝜑 ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))

Assertion

Ref	Expression
isomennd	⊢ (𝜑 → 𝑂 ∈ OutMeas)

Distinct variable groups:   𝑂,𝑎,𝑛,𝑥   𝑦,𝑂,𝑥   𝑋,𝑎   𝜑,𝑎,𝑛,𝑥   𝜑,𝑦

Allowed substitution hints:   𝑉(𝑥,𝑦,𝑛,𝑎)   𝑋(𝑥,𝑦,𝑛)

Proof of Theorem isomennd

Dummy variables 𝑓 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isomennd.o	. . . . 5 ⊢ (𝜑 → 𝑂:𝒫 𝑋⟶(0[,]+∞))
2		id 22	. . . . . 6 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → 𝑂:𝒫 𝑋⟶(0[,]+∞))
3		fdm 6495	. . . . . . 7 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → dom 𝑂 = 𝒫 𝑋)
4	3	feq2d 6473	. . . . . 6 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → (𝑂:dom 𝑂⟶(0[,]+∞) ↔ 𝑂:𝒫 𝑋⟶(0[,]+∞)))
5	2, 4	mpbird 260	. . . . 5 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → 𝑂:dom 𝑂⟶(0[,]+∞))
6	1, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝑂:dom 𝑂⟶(0[,]+∞))
7		unipw 5308	. . . . . . 7 ⊢ ∪ 𝒫 𝑋 = 𝑋
8	7	pweqi 4515	. . . . . 6 ⊢ 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋
9	8	a1i 11	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋)
10	1, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → dom 𝑂 = 𝒫 𝑋)
11	10	unieqd 4814	. . . . . 6 ⊢ (𝜑 → ∪ dom 𝑂 = ∪ 𝒫 𝑋)
12	11	pweqd 4516	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 ∪ 𝒫 𝑋)
13	9, 12, 10	3eqtr4rd 2844	. . . 4 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14		isomennd.o0	. . . 4 ⊢ (𝜑 → (𝑂‘∅) = 0)
15	6, 13, 14	jca31 518	. . 3 ⊢ (𝜑 → ((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0))
16		simpl 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝜑)
17		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 ∪ dom 𝑂)
18	12, 9	eqtrd 2833	. . . . . . . . 9 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
19	18	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
20	17, 19	eleqtrd 2892	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 𝑋)
21		elpwi 4506	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
22	20, 21	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ⊆ 𝑋)
23	22	adantrr 716	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑥 ⊆ 𝑋)
24		elpwi 4506	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝑥 → 𝑦 ⊆ 𝑥)
25	24	adantl 485	. . . . . 6 ⊢ ((𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥) → 𝑦 ⊆ 𝑥)
26	25	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑦 ⊆ 𝑥)
27		isomennd.le	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑋 ∧ 𝑦 ⊆ 𝑥) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
28	16, 23, 26, 27	syl3anc 1368	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
29	28	ralrimivva 3156	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥))
30		0le0 11726	. . . . . . . . 9 ⊢ 0 ≤ 0
31	30	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → 0 ≤ 0)
32		unieq 4811	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∪ ∅)
33		uni0 4828	. . . . . . . . . . . . . 14 ⊢ ∪ ∅ = ∅
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ ∅ = ∅)
35	32, 34	eqtrd 2833	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∅)
36	35	fveq2d 6649	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑂‘∪ 𝑥) = (𝑂‘∅))
37	36	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = (𝑂‘∅))
38	14	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∅) = 0)
39	37, 38	eqtrd 2833	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = 0)
40		reseq2 5813	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = (𝑂 ↾ ∅))
41		res0 5822	. . . . . . . . . . . . . 14 ⊢ (𝑂 ↾ ∅) = ∅
42	41	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ ∅) = ∅)
43	40, 42	eqtrd 2833	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = ∅)
44	43	fveq2d 6649	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^‘(𝑂 ↾ 𝑥)) = (Σ^‘∅))
45		sge00 43015	. . . . . . . . . . . 12 ⊢ (Σ^‘∅) = 0
46	45	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^‘∅) = 0)
47	44, 46	eqtrd 2833	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (Σ^‘(𝑂 ↾ 𝑥)) = 0)
48	47	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (Σ^‘(𝑂 ↾ 𝑥)) = 0)
49	39, 48	breq12d 5043	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → ((𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)) ↔ 0 ≤ 0))
50	31, 49	mpbird 260	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
51	50	ad4ant14 751	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
52		simpl 486	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω))
53		neqne 2995	. . . . . . . 8 ⊢ (¬ 𝑥 = ∅ → 𝑥 ≠ ∅)
54	53	adantl 485	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → 𝑥 ≠ ∅)
55		ssnnf1octb 41822	. . . . . . . . 9 ⊢ ((𝑥 ≼ ω ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
56	55	adantll 713	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
57	1	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑂:𝒫 𝑋⟶(0[,]+∞))
58	14	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∅) = 0)
59		simpr 488	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 dom 𝑂)
60	10	pweqd 4516	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
61	60	adantr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
62	59, 61	eleqtrd 2892	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 𝒫 𝑋)
63		elpwi 4506	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝒫 𝒫 𝑋 → 𝑥 ⊆ 𝒫 𝑋)
64	62, 63	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ⊆ 𝒫 𝑋)
65	64	adantr 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑥 ⊆ 𝒫 𝑋)
66		simpl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝜑)
67		isomennd.sa	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
68	66, 67	sylan 583	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
69	68	adantlr 714	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
70		simprl 770	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → dom 𝑓 ⊆ ℕ)
71		simprr 772	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑓:dom 𝑓–1-1-onto→𝑥)
72		eleq1w 2872	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ dom 𝑓 ↔ 𝑛 ∈ dom 𝑓))
73		fveq2 6645	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑓‘𝑚) = (𝑓‘𝑛))
74	72, 73	ifbieq1d 4448	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅) = if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
75	74	cbvmptv 5133	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
76	57, 58, 65, 69, 70, 71, 75	isomenndlem 43169	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
77	76	ex 416	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → ((dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))
78	77	ad2antrr 725	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → ((dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))
79	78	exlimdv 1934	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → (∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))
80	56, 79	mpd 15	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
81	52, 54, 80	syl2anc 587	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
82	51, 81	pm2.61dan 812	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))
83	82	ex 416	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → (𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))
84	83	ralrimiva 3149	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))
85	15, 29, 84	jca31 518	. 2 ⊢ (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥)))))
86		isomennd.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
87	86	pwexd 5245	. . . 4 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
88		fex 6966	. . . 4 ⊢ ((𝑂:𝒫 𝑋⟶(0[,]+∞) ∧ 𝒫 𝑋 ∈ V) → 𝑂 ∈ V)
89	1, 87, 88	syl2anc 587	. . 3 ⊢ (𝜑 → 𝑂 ∈ V)
90		isome 43133	. . 3 ⊢ (𝑂 ∈ V → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))))
91	89, 90	syl 17	. 2 ⊢ (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^‘(𝑂 ↾ 𝑥))))))
92	85, 91	mpbird 260	1 ⊢ (𝜑 → 𝑂 ∈ OutMeas)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538  ∃wex 1781   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  Vcvv 3441   ⊆ wss 3881  ∅c0 4243  ifcif 4425  𝒫 cpw 4497  ∪ cuni 4800  ∪ ciun 4881   class class class wbr 5030   ↦ cmpt 5110  dom cdm 5519   ↾ cres 5521  ⟶wf 6320  –1-1-onto→wf1o 6323  ‘cfv 6324  (class class class)co 7135  ωcom 7560   ≼ cdom 8490  0cc0 10526  +∞cpnf 10661   ≤ cle 10665  ℕcn 11625  [,]cicc 12729  Σ^{^}csumge0 43001  OutMeascome 43128

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-inf2 9088  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-oi 8958  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-z 11970  df-uz 12232  df-rp 12378  df-xadd 12496  df-ico 12732  df-icc 12733  df-fz 12886  df-fzo 13029  df-seq 13365  df-exp 13426  df-hash 13687  df-cj 14450  df-re 14451  df-im 14452  df-sqrt 14586  df-abs 14587  df-clim 14837  df-sum 15035  df-sumge0 43002  df-ome 43129

This theorem is referenced by:  ovnome  43212