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 33618

Description: Lemma for carsgclctun 33619. (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 13412	. . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ^*
2		carsgval.2	. . . . . . . 8 ⊢ (𝜑 → 𝑀:𝒫 𝑂⟶(0[,]+∞))
3		carsgclctunlem3.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑂)
4	3	elpwincl1 32031	. . . . . . . 8 ⊢ (𝜑 → (𝐸 ∩ ∪ 𝐴) ∈ 𝒫 𝑂)
5	2, 4	ffvelcdmd 7087	. . . . . . 7 ⊢ (𝜑 → (𝑀‘(𝐸 ∩ ∪ 𝐴)) ∈ (0[,]+∞))
6	1, 5	sselid 3980	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝐸 ∩ ∪ 𝐴)) ∈ ℝ^*)
7	3	elpwdifcl 32032	. . . . . . . 8 ⊢ (𝜑 → (𝐸 ∖ ∪ 𝐴) ∈ 𝒫 𝑂)
8	2, 7	ffvelcdmd 7087	. . . . . . 7 ⊢ (𝜑 → (𝑀‘(𝐸 ∖ ∪ 𝐴)) ∈ (0[,]+∞))
9	1, 8	sselid 3980	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝐸 ∖ ∪ 𝐴)) ∈ ℝ^*)
10	6, 9	xaddcld 13285	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
11	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
12		pnfge 13115	. . . 4 ⊢ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^* → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ +∞)
13	11, 12	syl 17	. . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ +∞)
14		simpr 484	. . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → (𝑀‘𝐸) = +∞)
15	13, 14	breqtrrd 5176	. 2 ⊢ ((𝜑 ∧ (𝑀‘𝐸) = +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
16		unieq 4919	. . . . . . . . . . . . 13 ⊢ (𝐴 = ∅ → ∪ 𝐴 = ∪ ∅)
17		uni0 4939	. . . . . . . . . . . . 13 ⊢ ∪ ∅ = ∅
18	16, 17	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ (𝐴 = ∅ → ∪ 𝐴 = ∅)
19	18	ineq2d 4212	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → (𝐸 ∩ ∪ 𝐴) = (𝐸 ∩ ∅))
20		in0 4391	. . . . . . . . . . 11 ⊢ (𝐸 ∩ ∅) = ∅
21	19, 20	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐸 ∩ ∪ 𝐴) = ∅)
22	21	fveq2d 6895	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (𝑀‘(𝐸 ∩ ∪ 𝐴)) = (𝑀‘∅))
23	18	difeq2d 4122	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → (𝐸 ∖ ∪ 𝐴) = (𝐸 ∖ ∅))
24		dif0 4372	. . . . . . . . . . 11 ⊢ (𝐸 ∖ ∅) = 𝐸
25	23, 24	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐸 ∖ ∪ 𝐴) = 𝐸)
26	25	fveq2d 6895	. . . . . . . . 9 ⊢ (𝐴 = ∅ → (𝑀‘(𝐸 ∖ ∪ 𝐴)) = (𝑀‘𝐸))
27	22, 26	oveq12d 7430	. . . . . . . 8 ⊢ (𝐴 = ∅ → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)))
28	27	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)))
29		carsgsiga.1	. . . . . . . . 9 ⊢ (𝜑 → (𝑀‘∅) = 0)
30	29	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (𝑀‘∅) = 0)
31	30	oveq1d 7427	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘∅) +_𝑒 (𝑀‘𝐸)) = (0 +_𝑒 (𝑀‘𝐸)))
32	2, 3	ffvelcdmd 7087	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀‘𝐸) ∈ (0[,]+∞))
33	1, 32	sselid 3980	. . . . . . . . 9 ⊢ (𝜑 → (𝑀‘𝐸) ∈ ℝ^*)
34	33	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (𝑀‘𝐸) ∈ ℝ^*)
35		xaddlid 13226	. . . . . . . 8 ⊢ ((𝑀‘𝐸) ∈ ℝ^* → (0 +_𝑒 (𝑀‘𝐸)) = (𝑀‘𝐸))
36	34, 35	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (0 +_𝑒 (𝑀‘𝐸)) = (𝑀‘𝐸))
37	28, 31, 36	3eqtrd 2775	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸))
38	37, 34	eqeltrd 2832	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^*)
39		xeqlelt 32255	. . . . . . 7 ⊢ ((((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ∈ ℝ^* ∧ (𝑀‘𝐸) ∈ ℝ^*) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸) ↔ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸))))
40	38, 34, 39	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) = (𝑀‘𝐸) ↔ (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸))))
41	37, 40	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = ∅) → (((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸) ∧ ¬ ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) < (𝑀‘𝐸)))
42	41	simpld 494	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
43	42	adantlr 712	. . 3 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 = ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
44		carsgclctun.2	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ (toCaraSiga‘𝑀))
45		fvex 6904	. . . . . . . . 9 ⊢ (toCaraSiga‘𝑀) ∈ V
46	45	ssex 5321	. . . . . . . 8 ⊢ (𝐴 ⊆ (toCaraSiga‘𝑀) → 𝐴 ∈ V)
47		0sdomg 9108	. . . . . . . 8 ⊢ (𝐴 ∈ V → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅))
48	44, 46, 47	3syl 18	. . . . . . 7 ⊢ (𝜑 → (∅ ≺ 𝐴 ↔ 𝐴 ≠ ∅))
49	48	biimpar 477	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ ∅) → ∅ ≺ 𝐴)
50	49	adantlr 712	. . . . 5 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ∅ ≺ 𝐴)
51		carsgclctun.1	. . . . . . 7 ⊢ (𝜑 → 𝐴 ≼ ω)
52		nnenom 13950	. . . . . . . 8 ⊢ ℕ ≈ ω
53	52	ensymi 9004	. . . . . . 7 ⊢ ω ≈ ℕ
54		domentr 9013	. . . . . . 7 ⊢ ((𝐴 ≼ ω ∧ ω ≈ ℕ) → 𝐴 ≼ ℕ)
55	51, 53, 54	sylancl 585	. . . . . 6 ⊢ (𝜑 → 𝐴 ≼ ℕ)
56	55	ad2antrr 723	. . . . 5 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → 𝐴 ≼ ℕ)
57		fodomr 9132	. . . . 5 ⊢ ((∅ ≺ 𝐴 ∧ 𝐴 ≼ ℕ) → ∃𝑓 𝑓:ℕ–onto→𝐴)
58	50, 56, 57	syl2anc 583	. . . 4 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ∃𝑓 𝑓:ℕ–onto→𝐴)
59		fveq2 6891	. . . . . . . . . 10 ⊢ (𝑛 = 𝑘 → (𝑓‘𝑛) = (𝑓‘𝑘))
60	59	iundisj 25298	. . . . . . . . 9 ⊢ ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))
61		fofn 6807	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–onto→𝐴 → 𝑓 Fn ℕ)
62		fniunfv 7249	. . . . . . . . . . . 12 ⊢ (𝑓 Fn ℕ → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ ran 𝑓)
63	61, 62	syl 17	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ ran 𝑓)
64		forn 6808	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–onto→𝐴 → ran 𝑓 = 𝐴)
65	64	unieqd 4922	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ ran 𝑓 = ∪ 𝐴)
66	63, 65	eqtrd 2771	. . . . . . . . . 10 ⊢ (𝑓:ℕ–onto→𝐴 → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝐴)
67	66	adantl 481	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ∪ 𝑛 ∈ ℕ (𝑓‘𝑛) = ∪ 𝐴)
68	60, 67	eqtr3id 2785	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)) = ∪ 𝐴)
69	68	ineq2d 4212	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))) = (𝐸 ∩ ∪ 𝐴))
70	69	fveq2d 6895	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) = (𝑀‘(𝐸 ∩ ∪ 𝐴)))
71	68	difeq2d 4122	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))) = (𝐸 ∖ ∪ 𝐴))
72	71	fveq2d 6895	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) = (𝑀‘(𝐸 ∖ ∪ 𝐴)))
73	70, 72	oveq12d 7430	. . . . 5 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))))) = ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))))
74		carsgval.1	. . . . . . 7 ⊢ (𝜑 → 𝑂 ∈ 𝑉)
75	74	ad3antrrr 727	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝑂 ∈ 𝑉)
76	2	ad3antrrr 727	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝑀:𝒫 𝑂⟶(0[,]+∞))
77	29	ad3antrrr 727	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘∅) = 0)
78		carsgsiga.2	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
79	78	3adant1r 1176	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
80	79	3adant1r 1176	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
81	80	3adant1r 1176	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
82		carsgsiga.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
83	82	3adant1r 1176	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
84	83	3adant1r 1176	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
85	84	3adant1r 1176	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑥 ⊆ 𝑦 ∧ 𝑦 ∈ 𝒫 𝑂) → (𝑀‘𝑥) ≤ (𝑀‘𝑦))
86	59	iundisj2 25299	. . . . . . 7 ⊢ Disj 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))
87	86	a1i 11	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → Disj 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))
88	75	adantr 480	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑂 ∈ 𝑉)
89	76	adantr 480	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑀:𝒫 𝑂⟶(0[,]+∞))
90	44	ad4antr 729	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝐴 ⊆ (toCaraSiga‘𝑀))
91		fof 6805	. . . . . . . . . 10 ⊢ (𝑓:ℕ–onto→𝐴 → 𝑓:ℕ⟶𝐴)
92	91	ad2antlr 724	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑓:ℕ⟶𝐴)
93		simpr 484	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
94	92, 93	ffvelcdmd 7087	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑓‘𝑛) ∈ 𝐴)
95	90, 94	sseldd 3983	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑓‘𝑛) ∈ (toCaraSiga‘𝑀))
96	77	adantr 480	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (𝑀‘∅) = 0)
97	81	3adant1r 1176	. . . . . . . 8 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑥 ≼ ω ∧ 𝑥 ⊆ 𝒫 𝑂) → (𝑀‘∪ 𝑥) ≤ Σ^*𝑦 ∈ 𝑥(𝑀‘𝑦))
98	88, 89, 96, 97	carsgsigalem 33613	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑒 ∈ 𝒫 𝑂 ∧ 𝑔 ∈ 𝒫 𝑂) → (𝑀‘(𝑒 ∪ 𝑔)) ≤ ((𝑀‘𝑒) +_𝑒 (𝑀‘𝑔)))
99	91	ad3antlr 728	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝑓:ℕ⟶𝐴)
100		fzossnn 13686	. . . . . . . . . . . . 13 ⊢ (1..^𝑛) ⊆ ℕ
101	100	a1i 11	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → (1..^𝑛) ⊆ ℕ)
102	101	sselda 3982	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝑘 ∈ ℕ)
103	99, 102	ffvelcdmd 7087	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → (𝑓‘𝑘) ∈ 𝐴)
104	103	ralrimiva 3145	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ 𝐴)
105		dfiun2g 5033	. . . . . . . . 9 ⊢ (∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ 𝐴 → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) = ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)})
106	104, 105	syl 17	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) = ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)})
107		eqid 2731	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) = (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘))
108	107	rnmpt 5954	. . . . . . . . . . 11 ⊢ ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) = {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)}
109		fzofi 13944	. . . . . . . . . . . 12 ⊢ (1..^𝑛) ∈ Fin
110		mptfi 9355	. . . . . . . . . . . 12 ⊢ ((1..^𝑛) ∈ Fin → (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin)
111		rnfi 9339	. . . . . . . . . . . 12 ⊢ ((𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin)
112	109, 110, 111	mp2b 10	. . . . . . . . . . 11 ⊢ ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ∈ Fin
113	108, 112	eqeltrri 2829	. . . . . . . . . 10 ⊢ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ Fin
114	113	a1i 11	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ Fin)
115	90	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → 𝐴 ⊆ (toCaraSiga‘𝑀))
116	115, 103	sseldd 3983	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) ∧ 𝑘 ∈ (1..^𝑛)) → (𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
117	116	ralrimiva 3145	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
118	107	rnmptss 7124	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀) → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ⊆ (toCaraSiga‘𝑀))
119	117, 118	syl 17	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ran (𝑘 ∈ (1..^𝑛) ↦ (𝑓‘𝑘)) ⊆ (toCaraSiga‘𝑀))
120	108, 119	eqsstrrid 4031	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ⊆ (toCaraSiga‘𝑀))
121	88, 89, 96, 97, 114, 120	fiunelcarsg 33614	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ {𝑧 ∣ ∃𝑘 ∈ (1..^𝑛)𝑧 = (𝑓‘𝑘)} ∈ (toCaraSiga‘𝑀))
122	106, 121	eqeltrd 2832	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘) ∈ (toCaraSiga‘𝑀))
123	88, 89, 95, 98, 122	difelcarsg2 33611	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) ∧ 𝑛 ∈ ℕ) → ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)) ∈ (toCaraSiga‘𝑀))
124	3	ad3antrrr 727	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → 𝐸 ∈ 𝒫 𝑂)
125		simpllr 773	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → (𝑀‘𝐸) ≠ +∞)
126	75, 76, 77, 81, 85, 87, 123, 124, 125	carsgclctunlem2 33617	. . . . 5 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘)))) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝑛 ∈ ℕ ((𝑓‘𝑛) ∖ ∪ 𝑘 ∈ (1..^𝑛)(𝑓‘𝑘))))) ≤ (𝑀‘𝐸))
127	73, 126	eqbrtrrd 5172	. . . 4 ⊢ ((((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) ∧ 𝑓:ℕ–onto→𝐴) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
128	58, 127	exlimddv 1937	. . 3 ⊢ (((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) ∧ 𝐴 ≠ ∅) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
129	43, 128	pm2.61dane 3028	. 2 ⊢ ((𝜑 ∧ (𝑀‘𝐸) ≠ +∞) → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))
130	15, 129	pm2.61dane 3028	1 ⊢ (𝜑 → ((𝑀‘(𝐸 ∩ ∪ 𝐴)) +_𝑒 (𝑀‘(𝐸 ∖ ∪ 𝐴))) ≤ (𝑀‘𝐸))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1780 ∈ wcel 2105 {cab 2708 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 Vcvv 3473 ∖ cdif 3945 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 𝒫 cpw 4602 ∪ cuni 4908 ∪ ciun 4997 Disj wdisj 5113 class class class wbr 5148 ↦ cmpt 5231 ran crn 5677 Fn wfn 6538 ⟶wf 6539 –onto→wfo 6541 ‘cfv 6543 (class class class)co 7412 ωcom 7859 ≈ cen 8940 ≼ cdom 8941 ≺ csdm 8942 Fincfn 8943 0cc0 11114 1c1 11115 +∞cpnf 11250 ℝ^*cxr 11252 < clt 11253 ≤ cle 11254 ℕcn 12217 +_𝑒 cxad 13095 [,]cicc 13332 ..^cfzo 13632 Σ^*cesum 33324 toCaraSigaccarsg 33599

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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-inf2 9640 ax-ac2 10462 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191 ax-pre-sup 11192 ax-addf 11193 ax-mulf 11194

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-disj 5114 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7674 df-om 7860 df-1st 7979 df-2nd 7980 df-supp 8151 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-2o 8471 df-er 8707 df-map 8826 df-pm 8827 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9366 df-fi 9410 df-sup 9441 df-inf 9442 df-oi 9509 df-dju 9900 df-card 9938 df-acn 9941 df-ac 10115 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11451 df-neg 11452 df-div 11877 df-nn 12218 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12478 df-z 12564 df-dec 12683 df-uz 12828 df-q 12938 df-rp 12980 df-xneg 13097 df-xadd 13098 df-xmul 13099 df-ioo 13333 df-ioc 13334 df-ico 13335 df-icc 13336 df-fz 13490 df-fzo 13633 df-fl 13762 df-mod 13840 df-seq 13972 df-exp 14033 df-fac 14239 df-bc 14268 df-hash 14296 df-shft 15019 df-cj 15051 df-re 15052 df-im 15053 df-sqrt 15187 df-abs 15188 df-limsup 15420 df-clim 15437 df-rlim 15438 df-sum 15638 df-ef 16016 df-sin 16018 df-cos 16019 df-pi 16021 df-struct 17085 df-sets 17102 df-slot 17120 df-ndx 17132 df-base 17150 df-ress 17179 df-plusg 17215 df-mulr 17216 df-starv 17217 df-sca 17218 df-vsca 17219 df-ip 17220 df-tset 17221 df-ple 17222 df-ds 17224 df-unif 17225 df-hom 17226 df-cco 17227 df-rest 17373 df-topn 17374 df-0g 17392 df-gsum 17393 df-topgen 17394 df-pt 17395 df-prds 17398 df-ordt 17452 df-xrs 17453 df-qtop 17458 df-imas 17459 df-xps 17461 df-mre 17535 df-mrc 17536 df-acs 17538 df-ps 18524 df-tsr 18525 df-plusf 18565 df-mgm 18566 df-sgrp 18645 df-mnd 18661 df-mhm 18706 df-submnd 18707 df-grp 18859 df-minusg 18860 df-sbg 18861 df-mulg 18988 df-subg 19040 df-cntz 19223 df-cmn 19692 df-abl 19693 df-mgp 20030 df-rng 20048 df-ur 20077 df-ring 20130 df-cring 20131 df-subrng 20435 df-subrg 20460 df-abv 20569 df-lmod 20617 df-scaf 20618 df-sra 20931 df-rgmod 20932 df-psmet 21137 df-xmet 21138 df-met 21139 df-bl 21140 df-mopn 21141 df-fbas 21142 df-fg 21143 df-cnfld 21146 df-top 22617 df-topon 22634 df-topsp 22656 df-bases 22670 df-cld 22744 df-ntr 22745 df-cls 22746 df-nei 22823 df-lp 22861 df-perf 22862 df-cn 22952 df-cnp 22953 df-haus 23040 df-tx 23287 df-hmeo 23480 df-fil 23571 df-fm 23663 df-flim 23664 df-flf 23665 df-tmd 23797 df-tgp 23798 df-tsms 23852 df-trg 23885 df-xms 24047 df-ms 24048 df-tms 24049 df-nm 24312 df-ngp 24313 df-nrg 24315 df-nlm 24316 df-ii 24618 df-cncf 24619 df-limc 25616 df-dv 25617 df-log 26302 df-esum 33325 df-carsg 33600

This theorem is referenced by: carsgclctun 33619

W3C validator