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 47069

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 6697	. . . . . . 7 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → dom 𝑂 = 𝒫 𝑋)
4	3	feq2d 6671	. . . . . 6 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → (𝑂:dom 𝑂⟶(0[,]+∞) ↔ 𝑂:𝒫 𝑋⟶(0[,]+∞)))
5	2, 4	mpbird 259	. . . . 5 ⊢ (𝑂:𝒫 𝑋⟶(0[,]+∞) → 𝑂:dom 𝑂⟶(0[,]+∞))
6	1, 5	syl 17	. . . 4 ⊢ (𝜑 → 𝑂:dom 𝑂⟶(0[,]+∞))
7		unipw 5416	. . . . . . 7 ⊢ ∪ 𝒫 𝑋 = 𝑋
8	7	pweqi 4570	. . . . . 6 ⊢ 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋
9	8	a1i 11	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ 𝒫 𝑋 = 𝒫 𝑋)
10	1, 3	syl 17	. . . . . . 7 ⊢ (𝜑 → dom 𝑂 = 𝒫 𝑋)
11	10	unieqd 4877	. . . . . 6 ⊢ (𝜑 → ∪ dom 𝑂 = ∪ 𝒫 𝑋)
12	11	pweqd 4571	. . . . 5 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 ∪ 𝒫 𝑋)
13	9, 12, 10	3eqtr4rd 2807	. . . 4 ⊢ (𝜑 → dom 𝑂 = 𝒫 ∪ dom 𝑂)
14		isomennd.o0	. . . 4 ⊢ (𝜑 → (𝑂‘∅) = 0)
15	6, 13, 14	jca31 522	. . 3 ⊢ (𝜑 → ((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0))
16		simpl 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝜑)
17		simpr 488	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 ∪ dom 𝑂)
18	12, 9	eqtrd 2796	. . . . . . . . 9 ⊢ (𝜑 → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
19	18	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝒫 ∪ dom 𝑂 = 𝒫 𝑋)
20	17, 19	eleqtrd 2863	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ∈ 𝒫 𝑋)
21		elpwi 4561	. . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
22	20, 21	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 ∪ dom 𝑂) → 𝑥 ⊆ 𝑋)
23	22	adantrr 727	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑥 ⊆ 𝑋)
24		elpwi 4561	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝑥 → 𝑦 ⊆ 𝑥)
25	24	adantl 485	. . . . . 6 ⊢ ((𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥) → 𝑦 ⊆ 𝑥)
26	25	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → 𝑦 ⊆ 𝑥)
27		isomennd.le	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑋 ∧ 𝑦 ⊆ 𝑥) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
28	16, 23, 26, 27	syl3anc 1389	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝒫 ∪ dom 𝑂 ∧ 𝑦 ∈ 𝒫 𝑥)) → (𝑂‘𝑦) ≤ (𝑂‘𝑥))
29	28	ralrimivva 3204	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥))
30		0le0 12316	. . . . . . . . 9 ⊢ 0 ≤ 0
31	30	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → 0 ≤ 0)
32		unieq 4875	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∪ ∅)
33		uni0 4893	. . . . . . . . . . . . . 14 ⊢ ∪ ∅ = ∅
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → ∪ ∅ = ∅)
35	32, 34	eqtrd 2796	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∅)
36	35	fveq2d 6867	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (𝑂‘∪ 𝑥) = (𝑂‘∅))
37	36	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = (𝑂‘∅))
38	14	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∅) = 0)
39	37, 38	eqtrd 2796	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) = 0)
40		reseq2 5958	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = (𝑂 ↾ ∅))
41		res0 5967	. . . . . . . . . . . . . 14 ⊢ (𝑂 ↾ ∅) = ∅
42	41	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑥 = ∅ → (𝑂 ↾ ∅) = ∅)
43	40, 42	eqtrd 2796	. . . . . . . . . . . 12 ⊢ (𝑥 = ∅ → (𝑂 ↾ 𝑥) = ∅)
44	43	fveq2d 6867	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^{^}‘(𝑂 ↾ 𝑥)) = (Σ^{^}‘∅))
45		sge00 46914	. . . . . . . . . . . 12 ⊢ (Σ^{^}‘∅) = 0
46	45	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 = ∅ → (Σ^{^}‘∅) = 0)
47	44, 46	eqtrd 2796	. . . . . . . . . 10 ⊢ (𝑥 = ∅ → (Σ^{^}‘(𝑂 ↾ 𝑥)) = 0)
48	47	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (Σ^{^}‘(𝑂 ↾ 𝑥)) = 0)
49	39, 48	breq12d 5112	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = ∅) → ((𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)) ↔ 0 ≤ 0))
50	31, 49	mpbird 259	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
51	50	ad4ant14 762	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
52		simpl 486	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω))
53		neqne 2964	. . . . . . . 8 ⊢ (¬ 𝑥 = ∅ → 𝑥 ≠ ∅)
54	53	adantl 485	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → 𝑥 ≠ ∅)
55		ssnnf1octb 45736	. . . . . . . . 9 ⊢ ((𝑥 ≼ ω ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
56	55	adantll 724	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → ∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥))
57	1	ad2antrr 736	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑂:𝒫 𝑋⟶(0[,]+∞))
58	14	ad2antrr 736	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∅) = 0)
59		simpr 488	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 dom 𝑂)
60	10	pweqd 4571	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
61	60	adantr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝒫 dom 𝑂 = 𝒫 𝒫 𝑋)
62	59, 61	eleqtrd 2863	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → 𝑥 ∈ 𝒫 𝒫 𝑋)
63		elpwi 4561	. . . . . . . . . . . . . 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 589	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
69	68	adantlr 725	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) ∧ 𝑎:ℕ⟶𝒫 𝑋) → (𝑂‘∪ 𝑛 ∈ ℕ (𝑎‘𝑛)) ≤ (Σ^{^}‘(𝑛 ∈ ℕ ↦ (𝑂‘(𝑎‘𝑛)))))
70		simprl 780	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → dom 𝑓 ⊆ ℕ)
71		simprr 782	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → 𝑓:dom 𝑓–1-1-onto→𝑥)
72		eleq1w 2844	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ dom 𝑓 ↔ 𝑛 ∈ dom 𝑓))
73		fveq2 6863	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑓‘𝑚) = (𝑓‘𝑛))
74	72, 73	ifbieq1d 4504	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅) = if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
75	74	cbvmptv 5203	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 ∈ dom 𝑓, (𝑓‘𝑚), ∅)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ dom 𝑓, (𝑓‘𝑛), ∅))
76	57, 58, 65, 69, 70, 71, 75	isomenndlem 47068	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ (dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥)) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
77	76	ex 416	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → ((dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
78	77	ad2antrr 736	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → ((dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
79	78	exlimdv 1952	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → (∃𝑓(dom 𝑓 ⊆ ℕ ∧ 𝑓:dom 𝑓–1-1-onto→𝑥) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
80	56, 79	mpd 15	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ 𝑥 ≠ ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
81	52, 54, 80	syl2anc 593	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) ∧ ¬ 𝑥 = ∅) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
82	51, 81	pm2.61dan 822	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) ∧ 𝑥 ≼ ω) → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))
83	82	ex 416	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝒫 dom 𝑂) → (𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
84	83	ralrimiva 3153	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥))))
85	15, 29, 84	jca31 522	. 2 ⊢ (𝜑 → ((((𝑂:dom 𝑂⟶(0[,]+∞) ∧ dom 𝑂 = 𝒫 ∪ dom 𝑂) ∧ (𝑂‘∅) = 0) ∧ ∀𝑥 ∈ 𝒫 ∪ dom 𝑂∀𝑦 ∈ 𝒫 𝑥(𝑂‘𝑦) ≤ (𝑂‘𝑥)) ∧ ∀𝑥 ∈ 𝒫 dom 𝑂(𝑥 ≼ ω → (𝑂‘∪ 𝑥) ≤ (Σ^{^}‘(𝑂 ↾ 𝑥)))))
86		isomennd.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
87	86	pwexd 5335	. . . 4 ⊢ (𝜑 → 𝒫 𝑋 ∈ V)
88	1, 87	fexd 7207	. . 3 ⊢ (𝜑 → 𝑂 ∈ V)
89		isome 47032	. . 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 259	1 ⊢ (𝜑 → 𝑂 ∈ OutMeas)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 Vcvv 3453 ⊆ wss 3904 ∅c0 4285 ifcif 4479 𝒫 cpw 4554 ∪ cuni 4864 ∪ ciun 4948 class class class wbr 5099 ↦ cmpt 5180 dom cdm 5645 ↾ cres 5647 ⟶wf 6513 –1-1-onto→wf1o 6516 ‘cfv 6517 (class class class)co 7392 ωcom 7842 ≼ cdom 8921 0cc0 11070 +∞cpnf 11210 ≤ cle 11214 ℕcn 12207 [,]cicc 13349 Σ^{^}csumge0 46900 OutMeascome 47027

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-inf2 9593 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-pre-sup 11148

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-isom 6526 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-sup 9385 df-oi 9455 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12208 df-2 12277 df-3 12278 df-n0 12479 df-z 12566 df-uz 12837 df-rp 12991 df-xadd 13112 df-ico 13352 df-icc 13353 df-fz 13510 df-fzo 13657 df-seq 14012 df-exp 14072 df-hash 14341 df-cj 15109 df-re 15110 df-im 15111 df-sqrt 15245 df-abs 15246 df-clim 15498 df-sum 15697 df-sumge0 46901 df-ome 47028

This theorem is referenced by: ovnome 47111

W3C validator