isomennd - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > isomennd		Structured version Visualization version GIF version

Theorem isomennd 46653

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 6665	. . . . . . 7 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → dom 𝑂 = 𝒫 𝑋)
4	3	feq2d 6640	. . . . . 6 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → (𝑂:dom 𝑂⟶(0[,]+∞) ↔ 𝑂:𝒫 𝑋⟶(0[,]+∞)))
5	2, 4	mpbird 257	. . . . 5 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → 𝑂:dom 𝑂⟶(0[,]+∞))
6	1, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝑂:dom 𝑂⟶(0[,]+∞))
7		unipw 5393	. . . . . . 7 ⊢ ∪ 𝒫 𝑋 = 𝑋
8	7	pweqi 4565	. . . . . 6 ⊢ 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋
9	8	a1i 11	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋)
10	1, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → dom 𝑂 = 𝒫 𝑋)
11	10	unieqd 4871	. . . . . 6 ⊢ (𝜑 → ∪ dom 𝑂 = ∪ 𝒫 𝑋)
12	11	pweqd 4566	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 ∪ 𝒫 𝑋)
13	9, 12, 10	3eqtr4rd 2779	. . . 4 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14		isomennd.o0	. . . 4 ⊢ (𝜑 → (𝑂‘∅) = 0)
15	6, 13, 14	jca31 514	. . 3 ⊢ (𝜑 → ((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0))
16		simpl 482	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝜑)
17		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 ∪ dom 𝑂)
18	12, 9	eqtrd 2768	. . . . . . . . 9 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
19	18	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
20	17, 19	eleqtrd 2835	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 𝑋)
21		elpwi 4556	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
22	20, 21	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ⊆ 𝑋)
23	22	adantrr 717	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑥 ⊆ 𝑋)
24		elpwi 4556	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝑥 → 𝑦 ⊆ 𝑥)
25	24	adantl 481	. . . . . 6 ⊢ ((𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥) → 𝑦 ⊆ 𝑥)
26	25	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑦 ⊆ 𝑥)
27		isomennd.le	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑋 ∧ 𝑦 ⊆ 𝑥) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
28	16, 23, 26, 27	syl3anc 1373	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
29	28	ralrimivva 3176	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥))
30		0le0 12233	. . . . . . . . 9 ⊢ 0 ≤ 0
31	30	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → 0 ≤ 0)
32		unieq 4869	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∪ ∅)
33		uni0 4886	. . . . . . . . . . . . . 14 ⊢ ∪ ∅ = ∅
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ ∅ = ∅)
35	32, 34	eqtrd 2768	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∅)
36	35	fveq2d 6832	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑂‘∪ 𝑥) = (𝑂‘∅))
37	36	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = (𝑂‘∅))
38	14	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∅) = 0)
39	37, 38	eqtrd 2768	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = 0)
40		reseq2 5927	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = (𝑂 ↾ ∅))
41		res0 5936	. . . . . . . . . . . . . 14 ⊢ (𝑂 ↾ ∅) = ∅
42	41	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ ∅) = ∅)
43	40, 42	eqtrd 2768	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = ∅)
44	43	fveq2d 6832	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^{^}‘(𝑂 ↾ 𝑥)) = (Σ^{^}‘∅))
45		sge00 46498	. . . . . . . . . . . 12 ⊢ (Σ^{^}‘∅) = 0
46	45	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^{^}‘∅) = 0)
47	44, 46	eqtrd 2768	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (Σ^{^}‘(𝑂 ↾ 𝑥)) = 0)
48	47	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (Σ^{^}‘(𝑂 ↾ 𝑥)) = 0)
49	39, 48	breq12d 5106	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → ((𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)) ↔ 0 ≤ 0))
50	31, 49	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
51	50	ad4ant14 752	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
52		simpl 482	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω))
53		neqne 2937	. . . . . . . 8 ⊢ (¬ 𝑥 = ∅ → 𝑥 ≠ ∅)
54	53	adantl 481	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → 𝑥 ≠ ∅)
55		ssnnf1octb 45315	. . . . . . . . 9 ⊢ ((𝑥 ≼ ω ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
56	55	adantll 714	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
57	1	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑂:𝒫 𝑋⟶(0[,]+∞))
58	14	ad2antrr 726	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∅) = 0)
59		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 dom 𝑂)
60	10	pweqd 4566	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
61	60	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
62	59, 61	eleqtrd 2835	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 𝒫 𝑋)
63		elpwi 4556	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝒫 𝒫 𝑋 → 𝑥 ⊆ 𝒫 𝑋)
64	62, 63	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ⊆ 𝒫 𝑋)
65	64	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑥 ⊆ 𝒫 𝑋)
66		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝜑)
67		isomennd.sa	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
68	66, 67	sylan 580	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
69	68	adantlr 715	. . . . . . . . . . . 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 2816	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ dom 𝑓 ↔ 𝑛 ∈ dom 𝑓))
73		fveq2 6828	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑓‘𝑚) = (𝑓‘𝑛))
74	72, 73	ifbieq1d 4499	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅) = if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
75	74	cbvmptv 5197	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
76	57, 58, 65, 69, 70, 71, 75	isomenndlem 46652	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
77	76	ex 412	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → ((dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
78	77	ad2antrr 726	. . . . . . . . 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 584	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
82	51, 81	pm2.61dan 812	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
83	82	ex 412	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → (𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
84	83	ralrimiva 3125	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
85	15, 29, 84	jca31 514	. 2 ⊢ (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))))
86		isomennd.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
87	86	pwexd 5319	. . . 4 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
88	1, 87	fexd 7167	. . 3 ⊢ (𝜑 → 𝑂 ∈ V)
89		isome 46616	. . 3 ⊢ (𝑂 ∈ V → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))))
90	88, 89	syl 17	. 2 ⊢ (𝜑 → (𝑂 ∈ OutMeas ↔ ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))))
91	85, 90	mpbird 257	1 ⊢ (𝜑 → 𝑂 ∈ OutMeas)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∃wex 1780 ∈ wcel 2113 ≠ wne 2929 ∀wral 3048 Vcvv 3437 ⊆ wss 3898 ∅c0 4282 ifcif 4474 𝒫 cpw 4549 ∪ cuni 4858 ∪ ciun 4941 class class class wbr 5093 ↦ cmpt 5174 dom cdm 5619 ↾ cres 5621 ⟶wf 6482 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7352 ωcom 7802 ≼ cdom 8873 0cc0 11013 +∞cpnf 11150 ≤ cle 11154 ℕcn 12132 [,]cicc 13250 Σ^{^}csumge0 46484 OutMeascome 46611

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-inf2 9538 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-pre-sup 11091

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-sup 9333 df-oi 9403 df-card 9839 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-3 12196 df-n0 12389 df-z 12476 df-uz 12739 df-rp 12893 df-xadd 13014 df-ico 13253 df-icc 13254 df-fz 13410 df-fzo 13557 df-seq 13911 df-exp 13971 df-hash 14240 df-cj 15008 df-re 15009 df-im 15010 df-sqrt 15144 df-abs 15145 df-clim 15397 df-sum 15596 df-sumge0 46485 df-ome 46612

This theorem is referenced by: ovnome 46695

W3C validator