carsgclctunlem3 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > carsgclctunlem3		Structured version Visualization version GIF version

Theorem carsgclctunlem3 33319

Description: Lemma for carsgclctun 33320. (Contributed by Thierry Arnoux, 24-May-2020.)

**Hypotheses**
Ref	Expression
carsgval.1	⊢ (𝜑 → 𝑂 ∈ 𝑉)
carsgval.2	⊢ (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞))
carsgsiga.1	⊢ (𝜑 → (𝑀‘∅) = 0)
carsgsiga.2	⊢ ((𝜑 ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
carsgsiga.3	⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
carsgclctun.1	⊢ (𝜑 → 𝐴 ≼ ω)
carsgclctun.2	⊢ (𝜑 → 𝐴 ⊆ (toCaraSiga‘𝑀))
carsgclctunlem3.1	⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑂)

**Assertion**
Ref	Expression
carsgclctunlem3	⊢ (𝜑 → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐸,𝑦 𝑥,𝑀,𝑦 𝑥,𝑂,𝑦 𝜑,𝑥,𝑦 Allowed substitution hints: 𝑉(𝑥,𝑦)

Proof of Theorem carsgclctunlem3 Dummy variables 𝑒 𝑓 𝑘 𝑛 𝑧 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iccssxr 13407	. . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ^*
2		carsgval.2	. . . . . . . 8 ⊢ (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞))
3		carsgclctunlem3.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑂)
4	3	elpwincl1 31763	. . . . . . . 8 ⊢ (𝜑 → (𝐸 ∩ ∪ 𝐴) ∈ 𝒫 𝑂)
5	2, 4	ffvelcdmd 7088	. . . . . . 7 ⊢ (𝜑 → (𝑀‘(𝐸 ∩ ∪ 𝐴)) ∈ (0[,]+∞))
6	1, 5	sselid 3981	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝐸 ∩ ∪ 𝐴)) ∈ ℝ^*)
7	3	elpwdifcl 31764	. . . . . . . 8 ⊢ (𝜑 → (𝐸 ∖ ∪ 𝐴) ∈ 𝒫 𝑂)
8	2, 7	ffvelcdmd 7088	. . . . . . 7 ⊢ (𝜑 → (𝑀‘(𝐸 ∖ ∪ 𝐴)) ∈ (0[,]+∞))
9	1, 8	sselid 3981	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝐸 ∖ ∪ 𝐴)) ∈ ℝ^*)
10	6, 9	xaddcld 13280	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
11	10	adantr 482	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
12		pnfge 13110	. . . 4 ⊢ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^* → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ +∞)
13	11, 12	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ +∞)
14		simpr 486	. . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → (𝑀‘𝐸) = +∞)
15	13, 14	breqtrrd 5177	. 2 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
16		unieq 4920	. . . . . . . . . . . . 13 ⊢ (𝐴 = ∅ → ∪ 𝐴 = ∪ ∅)
17		uni0 4940	. . . . . . . . . . . . 13 ⊢ ∪ ∅ = ∅
18	16, 17	eqtrdi 2789	. . . . . . . . . . . 12 ⊢ (𝐴 = ∅ → ∪ 𝐴 = ∅)
19	18	ineq2d 4213	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → (𝐸 ∩ ∪ 𝐴) = (𝐸 ∩ ∅))
20		in0 4392	. . . . . . . . . . 11 ⊢ (𝐸 ∩ ∅) = ∅
21	19, 20	eqtrdi 2789	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐸 ∩ ∪ 𝐴) = ∅)
22	21	fveq2d 6896	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (𝑀‘(𝐸 ∩ ∪ 𝐴)) = (𝑀‘∅))
23	18	difeq2d 4123	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → (𝐸 ∖ ∪ 𝐴) = (𝐸 ∖ ∅))
24		dif0 4373	. . . . . . . . . . 11 ⊢ (𝐸 ∖ ∅) = 𝐸
25	23, 24	eqtrdi 2789	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐸 ∖ ∪ 𝐴) = 𝐸)
26	25	fveq2d 6896	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (𝑀‘(𝐸 ∖ ∪ 𝐴)) = (𝑀‘𝐸))
27	22, 26	oveq12d 7427	. . . . . . . 8 ⊢ (𝐴 = ∅ → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)))
28	27	adantl 483	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)))
29		carsgsiga.1	. . . . . . . . 9 ⊢ (𝜑 → (𝑀‘∅) = 0)
30	29	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (𝑀‘∅) = 0)
31	30	oveq1d 7424	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)) = (0 +_𝑒 (𝑀‘𝐸)))
32	2, 3	ffvelcdmd 7088	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘𝐸) ∈ (0[,]+∞))
33	1, 32	sselid 3981	. . . . . . . . 9 ⊢ (𝜑 → (𝑀‘𝐸) ∈ ℝ^*)
34	33	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (𝑀‘𝐸) ∈ ℝ^*)
35		xaddlid 13221	. . . . . . . 8 ⊢ ((𝑀‘𝐸) ∈ ℝ^* → (0 +_𝑒 (𝑀‘𝐸)) = (𝑀‘𝐸))
36	34, 35	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (0 +_𝑒 (𝑀‘𝐸)) = (𝑀‘𝐸))
37	28, 31, 36	3eqtrd 2777	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸))
38	37, 34	eqeltrd 2834	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
39		xeqlelt 31987	. . . . . . 7 ⊢ ((((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^* ∧ (𝑀‘𝐸) ∈ ℝ^*) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸) ↔ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸))))
40	38, 34, 39	syl2anc 585	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸) ↔ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸))))
41	37, 40	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸)))
42	41	simpld 496	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
43	42	adantlr 714	. . 3 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
44		carsgclctun.2	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ (toCaraSiga‘𝑀))
45		fvex 6905	. . . . . . . . 9 ⊢ (toCaraSiga‘𝑀) ∈ V
46	45	ssex 5322	. . . . . . . 8 ⊢ (𝐴 ⊆ (toCaraSiga‘𝑀) → 𝐴 ∈ V)
47		0sdomg 9104	. . . . . . . 8 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅))
48	44, 46, 47	3syl 18	. . . . . . 7 ⊢ (𝜑 → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅))
49	48	biimpar 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∅ ≺ 𝐴)
50	49	adantlr 714	. . . . 5 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ∅ ≺ 𝐴)
51		carsgclctun.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≼ ω)
52		nnenom 13945	. . . . . . . 8 ⊢ ℕ ≈ ω
53	52	ensymi 9000	. . . . . . 7 ⊢ ω ≈ ℕ
54		domentr 9009	. . . . . . 7 ⊢ ((𝐴 ≼ ω ∧ ω ≈ ℕ) → 𝐴 ≼ ℕ)
55	51, 53, 54	sylancl 587	. . . . . 6 ⊢ (𝜑 → 𝐴 ≼ ℕ)
56	55	ad2antrr 725	. . . . 5 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → 𝐴 ≼ ℕ)
57		fodomr 9128	. . . . 5 ⊢ ((∅ ≺ 𝐴 ∧ 𝐴 ≼ ℕ) → ∃𝑓 𝑓:ℕ–onto→𝐴)
58	50, 56, 57	syl2anc 585	. . . 4 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ∃𝑓 𝑓:ℕ–onto→𝐴)
59		fveq2 6892	. . . . . . . . . 10 ⊢ (𝑛 = 𝑘 → (𝑓‘𝑛) = (𝑓‘𝑘))
60	59	iundisj 25065	. . . . . . . . 9 ⊢ ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))
61		fofn 6808	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–onto→𝐴 → 𝑓 Fn ℕ)
62		fniunfv 7246	. . . . . . . . . . . 12 ⊢ (𝑓 Fn ℕ → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ ran 𝑓)
63	61, 62	syl 17	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ ran 𝑓)
64		forn 6809	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–onto→𝐴 → ran 𝑓 = 𝐴)
65	64	unieqd 4923	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ ran 𝑓 = ∪ 𝐴)
66	63, 65	eqtrd 2773	. . . . . . . . . 10 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝐴)
67	66	adantl 483	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝐴)
68	60, 67	eqtr3id 2787	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)) = ∪ 𝐴)
69	68	ineq2d 4213	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))) = (𝐸 ∩ ∪ 𝐴))
70	69	fveq2d 6896	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) = (𝑀‘(𝐸 ∩ ∪ 𝐴)))
71	68	difeq2d 4123	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))) = (𝐸 ∖ ∪ 𝐴))
72	71	fveq2d 6896	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) = (𝑀‘(𝐸 ∖ ∪ 𝐴)))
73	70, 72	oveq12d 7427	. . . . 5 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))))) = ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))))
74		carsgval.1	. . . . . . 7 ⊢ (𝜑 → 𝑂 ∈ 𝑉)
75	74	ad3antrrr 729	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝑂 ∈ 𝑉)
76	2	ad3antrrr 729	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝑀:𝒫 𝑂⟶(0[,]+∞))
77	29	ad3antrrr 729	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘∅) = 0)
78		carsgsiga.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
79	78	3adant1r 1178	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
80	79	3adant1r 1178	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
81	80	3adant1r 1178	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
82		carsgsiga.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
83	82	3adant1r 1178	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
84	83	3adant1r 1178	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
85	84	3adant1r 1178	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
86	59	iundisj2 25066	. . . . . . 7 ⊢ Disj 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))
87	86	a1i 11	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → Disj 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))
88	75	adantr 482	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑂 ∈ 𝑉)
89	76	adantr 482	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑀:𝒫 𝑂⟶(0[,]+∞))
90	44	ad4antr 731	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝐴 ⊆ (toCaraSiga‘𝑀))
91		fof 6806	. . . . . . . . . 10 ⊢ (𝑓:ℕ–onto→𝐴 → 𝑓:ℕ⟶𝐴)
92	91	ad2antlr 726	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑓:ℕ⟶𝐴)
93		simpr 486	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
94	92, 93	ffvelcdmd 7088	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑓‘𝑛) ∈ 𝐴)
95	90, 94	sseldd 3984	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑓‘𝑛) ∈ (toCaraSiga‘𝑀))
96	77	adantr 482	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑀‘∅) = 0)
97	81	3adant1r 1178	. . . . . . . 8 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
98	88, 89, 96, 97	carsgsigalem 33314	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑒 ∈ 𝒫 𝑂 ∧ 𝑔 ∈ 𝒫 𝑂) → (𝑀‘(𝑒 ∪ 𝑔)) ≤ ((𝑀‘𝑒) +_𝑒 (𝑀‘𝑔)))
99	91	ad3antlr 730	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝑓:ℕ⟶𝐴)
100		fzossnn 13681	. . . . . . . . . . . . 13 ⊢ (1..^𝑛) ⊆ ℕ
101	100	a1i 11	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (1..^𝑛) ⊆ ℕ)
102	101	sselda 3983	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝑘 ∈ ℕ)
103	99, 102	ffvelcdmd 7088	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → (𝑓‘𝑘) ∈ 𝐴)
104	103	ralrimiva 3147	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ 𝐴)
105		dfiun2g 5034	. . . . . . . . 9 ⊢ (∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ 𝐴 → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) = ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)})
106	104, 105	syl 17	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) = ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)})
107		eqid 2733	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) = (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘))
108	107	rnmpt 5955	. . . . . . . . . . 11 ⊢ ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) = {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)}
109		fzofi 13939	. . . . . . . . . . . 12 ⊢ (1..^𝑛) ∈ Fin
110		mptfi 9351	. . . . . . . . . . . 12 ⊢ ((1..^𝑛) ∈ Fin → (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin)
111		rnfi 9335	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin)
112	109, 110, 111	mp2b 10	. . . . . . . . . . 11 ⊢ ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin
113	108, 112	eqeltrri 2831	. . . . . . . . . 10 ⊢ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ Fin
114	113	a1i 11	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ Fin)
115	90	adantr 482	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝐴 ⊆ (toCaraSiga‘𝑀))
116	115, 103	sseldd 3984	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → (𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
117	116	ralrimiva 3147	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
118	107	rnmptss 7122	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀) → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ⊆ (toCaraSiga‘𝑀))
119	117, 118	syl 17	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ⊆ (toCaraSiga‘𝑀))
120	108, 119	eqsstrrid 4032	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ⊆ (toCaraSiga‘𝑀))
121	88, 89, 96, 97, 114, 120	fiunelcarsg 33315	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ (toCaraSiga‘𝑀))
122	106, 121	eqeltrd 2834	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
123	88, 89, 95, 98, 122	difelcarsg2 33312	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)) ∈ (toCaraSiga‘𝑀))
124	3	ad3antrrr 729	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝐸 ∈ 𝒫 𝑂)
125		simpllr 775	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘𝐸) ≠ +∞)
126	75, 76, 77, 81, 85, 87, 123, 124, 125	carsgclctunlem2 33318	. . . . 5 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))))) ≤ (𝑀‘𝐸))
127	73, 126	eqbrtrrd 5173	. . . 4 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
128	58, 127	exlimddv 1939	. . 3 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
129	43, 128	pm2.61dane 3030	. 2 ⊢ ((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
130	15, 129	pm2.61dane 3030	1 ⊢ (𝜑 → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∃wex 1782 ∈ wcel 2107 {cab 2710 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∖ cdif 3946 ∩ cin 3948 ⊆ wss 3949 ∅c0 4323 𝒫 cpw 4603 ∪ cuni 4909 ∪ ciun 4998 Disj wdisj 5114 class class class wbr 5149 ↦ cmpt 5232 ran crn 5678 Fn wfn 6539 ⟶wf 6540 –onto→wfo 6542 ‘cfv 6544 (class class class)co 7409 ωcom 7855 ≈ cen 8936 ≼ cdom 8937 ≺ csdm 8938 Fincfn 8939 0cc0 11110 1c1 11111 +∞cpnf 11245 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 ℕcn 12212 +_𝑒 cxad 13090 [,]cicc 13327 ..^cfzo 13627 Σ^*cesum 33025 toCaraSigaccarsg 33300

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-ac2 10458 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189 ax-mulf 11190

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-disj 5115 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-om 7856 df-1st 7975 df-2nd 7976 df-supp 8147 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9362 df-fi 9406 df-sup 9437 df-inf 9438 df-oi 9505 df-dju 9896 df-card 9934 df-acn 9937 df-ac 10111 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ioo 13328 df-ioc 13329 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-fac 14234 df-bc 14263 df-hash 14291 df-shft 15014 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-limsup 15415 df-clim 15432 df-rlim 15433 df-sum 15633 df-ef 16011 df-sin 16013 df-cos 16014 df-pi 16016 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-hom 17221 df-cco 17222 df-rest 17368 df-topn 17369 df-0g 17387 df-gsum 17388 df-topgen 17389 df-pt 17390 df-prds 17393 df-ordt 17447 df-xrs 17448 df-qtop 17453 df-imas 17454 df-xps 17456 df-mre 17530 df-mrc 17531 df-acs 17533 df-ps 18519 df-tsr 18520 df-plusf 18560 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-mhm 18671 df-submnd 18672 df-grp 18822 df-minusg 18823 df-sbg 18824 df-mulg 18951 df-subg 19003 df-cntz 19181 df-cmn 19650 df-abl 19651 df-mgp 19988 df-ur 20005 df-ring 20058 df-cring 20059 df-subrg 20317 df-abv 20425 df-lmod 20473 df-scaf 20474 df-sra 20785 df-rgmod 20786 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-fbas 20941 df-fg 20942 df-cnfld 20945 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-cld 22523 df-ntr 22524 df-cls 22525 df-nei 22602 df-lp 22640 df-perf 22641 df-cn 22731 df-cnp 22732 df-haus 22819 df-tx 23066 df-hmeo 23259 df-fil 23350 df-fm 23442 df-flim 23443 df-flf 23444 df-tmd 23576 df-tgp 23577 df-tsms 23631 df-trg 23664 df-xms 23826 df-ms 23827 df-tms 23828 df-nm 24091 df-ngp 24092 df-nrg 24094 df-nlm 24095 df-ii 24393 df-cncf 24394 df-limc 25383 df-dv 25384 df-log 26065 df-esum 33026 df-carsg 33301

This theorem is referenced by: carsgclctun 33320

W3C validator