cantnfp1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cantnfp1		Structured version Visualization version GIF version

Theorem cantnfp1 9617

Description: If 𝐹 is created by adding a single term (𝐹‘𝑋) = 𝑌 to 𝐺, where 𝑋 is larger than any element of the support of 𝐺, then 𝐹 is also a finitely supported function and it is assigned the value ((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o 𝑧 where 𝑧 is the value of 𝐺. (Contributed by Mario Carneiro, 28-May-2015.) (Revised by AV, 1-Jul-2019.)

**Hypotheses**
Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
cantnfp1.g	⊢ (𝜑 → 𝐺 ∈ 𝑆)
cantnfp1.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
cantnfp1.y	⊢ (𝜑 → 𝑌 ∈ 𝐴)
cantnfp1.s	⊢ (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
cantnfp1.f	⊢ 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))

**Assertion**
Ref	Expression
cantnfp1	⊢ (𝜑 → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺))))

Distinct variable groups: 𝑡,𝐵 𝑡,𝐴 𝑡,𝑆 𝑡,𝐺 𝜑,𝑡 𝑡,𝑌 𝑡,𝑋 Allowed substitution hint: 𝐹(𝑡)

Proof of Theorem cantnfp1 Dummy variables 𝑘 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnfp1.f	. . . . . 6 ⊢ 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))
2		cantnfs.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ On)
3		cantnfp1.x	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
4		onelon 6342	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ On ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ On)
5	2, 3, 4	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ On)
6		eloni 6327	. . . . . . . . . . . 12 ⊢ (𝑋 ∈ On → Ord 𝑋)
7		ordirr 6335	. . . . . . . . . . . 12 ⊢ (Ord 𝑋 → ¬ 𝑋 ∈ 𝑋)
8	5, 6, 7	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑋)
9		fvex 6855	. . . . . . . . . . . . . 14 ⊢ (𝐺‘𝑋) ∈ V
10		dif1o 8446	. . . . . . . . . . . . . 14 ⊢ ((𝐺‘𝑋) ∈ (V ∖ 1_o) ↔ ((𝐺‘𝑋) ∈ V ∧ (𝐺‘𝑋) ≠ ∅))
11	9, 10	mpbiran 707	. . . . . . . . . . . . 13 ⊢ ((𝐺‘𝑋) ∈ (V ∖ 1_o) ↔ (𝐺‘𝑋) ≠ ∅)
12		cantnfp1.g	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝐺 ∈ 𝑆)
13		cantnfs.s	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
14		cantnfs.a	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐴 ∈ On)
15	13, 14, 2	cantnfs 9602	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
16	12, 15	mpbid 231	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
17	16	simpld 495	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
18	17	ffnd 6669	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐺 Fn 𝐵)
19		0ex 5264	. . . . . . . . . . . . . . . . . 18 ⊢ ∅ ∈ V
20	19	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∅ ∈ V)
21		elsuppfn 8102	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ On ∧ ∅ ∈ V) → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ≠ ∅)))
22	18, 2, 20, 21	syl3anc 1371	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ≠ ∅)))
23	11	bicomi 223	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺‘𝑋) ≠ ∅ ↔ (𝐺‘𝑋) ∈ (V ∖ 1_o))
24	23	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝐺‘𝑋) ≠ ∅ ↔ (𝐺‘𝑋) ∈ (V ∖ 1_o)))
25	24	anbi2d 629	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ((𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ≠ ∅) ↔ (𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ∈ (V ∖ 1_o))))
26	22, 25	bitrd 278	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋 ∈ (𝐺 supp ∅) ↔ (𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ∈ (V ∖ 1_o))))
27		cantnfp1.s	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
28	27	sseld 3943	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋 ∈ (𝐺 supp ∅) → 𝑋 ∈ 𝑋))
29	26, 28	sylbird 259	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝑋 ∈ 𝐵 ∧ (𝐺‘𝑋) ∈ (V ∖ 1_o)) → 𝑋 ∈ 𝑋))
30	3, 29	mpand 693	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐺‘𝑋) ∈ (V ∖ 1_o) → 𝑋 ∈ 𝑋))
31	11, 30	biimtrrid 242	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐺‘𝑋) ≠ ∅ → 𝑋 ∈ 𝑋))
32	31	necon1bd 2961	. . . . . . . . . . 11 ⊢ (𝜑 → (¬ 𝑋 ∈ 𝑋 → (𝐺‘𝑋) = ∅))
33	8, 32	mpd 15	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺‘𝑋) = ∅)
34	33	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ 𝑡 = 𝑋) → (𝐺‘𝑋) = ∅)
35		simpr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ 𝑡 = 𝑋) → 𝑡 = 𝑋)
36	35	fveq2d 6846	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ 𝑡 = 𝑋) → (𝐺‘𝑡) = (𝐺‘𝑋))
37		simpllr 774	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ 𝑡 = 𝑋) → 𝑌 = ∅)
38	34, 36, 37	3eqtr4rd 2787	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ 𝑡 = 𝑋) → 𝑌 = (𝐺‘𝑡))
39		eqidd 2737	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) ∧ ¬ 𝑡 = 𝑋) → (𝐺‘𝑡) = (𝐺‘𝑡))
40	38, 39	ifeqda 4522	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑌 = ∅) ∧ 𝑡 ∈ 𝐵) → if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)) = (𝐺‘𝑡))
41	40	mpteq2dva 5205	. . . . . 6 ⊢ ((𝜑 ∧ 𝑌 = ∅) → (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡))) = (𝑡 ∈ 𝐵 ↦ (𝐺‘𝑡)))
42	1, 41	eqtrid 2788	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = ∅) → 𝐹 = (𝑡 ∈ 𝐵 ↦ (𝐺‘𝑡)))
43	17	feqmptd 6910	. . . . . 6 ⊢ (𝜑 → 𝐺 = (𝑡 ∈ 𝐵 ↦ (𝐺‘𝑡)))
44	43	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = ∅) → 𝐺 = (𝑡 ∈ 𝐵 ↦ (𝐺‘𝑡)))
45	42, 44	eqtr4d 2779	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = ∅) → 𝐹 = 𝐺)
46	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = ∅) → 𝐺 ∈ 𝑆)
47	45, 46	eqeltrd 2838	. . 3 ⊢ ((𝜑 ∧ 𝑌 = ∅) → 𝐹 ∈ 𝑆)
48		oecl 8483	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑_o 𝐵) ∈ On)
49	14, 2, 48	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐴 ↑_o 𝐵) ∈ On)
50	13, 14, 2	cantnff 9610	. . . . . . . 8 ⊢ (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑_o 𝐵))
51	50, 12	ffvelcdmd 7036	. . . . . . 7 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) ∈ (𝐴 ↑_o 𝐵))
52		onelon 6342	. . . . . . 7 ⊢ (((𝐴 ↑_o 𝐵) ∈ On ∧ ((𝐴 CNF 𝐵)‘𝐺) ∈ (𝐴 ↑_o 𝐵)) → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
53	49, 51, 52	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
54	53	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐺) ∈ On)
55		oa0r 8484	. . . . 5 ⊢ (((𝐴 CNF 𝐵)‘𝐺) ∈ On → (∅ +_o ((𝐴 CNF 𝐵)‘𝐺)) = ((𝐴 CNF 𝐵)‘𝐺))
56	54, 55	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = ∅) → (∅ +_o ((𝐴 CNF 𝐵)‘𝐺)) = ((𝐴 CNF 𝐵)‘𝐺))
57		oveq2 7365	. . . . . 6 ⊢ (𝑌 = ∅ → ((𝐴 ↑_o 𝑋) ·_o 𝑌) = ((𝐴 ↑_o 𝑋) ·_o ∅))
58		oecl 8483	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑_o 𝑋) ∈ On)
59	14, 5, 58	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝐴 ↑_o 𝑋) ∈ On)
60		om0 8463	. . . . . . 7 ⊢ ((𝐴 ↑_o 𝑋) ∈ On → ((𝐴 ↑_o 𝑋) ·_o ∅) = ∅)
61	59, 60	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o ∅) = ∅)
62	57, 61	sylan9eqr 2798	. . . . 5 ⊢ ((𝜑 ∧ 𝑌 = ∅) → ((𝐴 ↑_o 𝑋) ·_o 𝑌) = ∅)
63	62	oveq1d 7372	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = ∅) → (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺)) = (∅ +_o ((𝐴 CNF 𝐵)‘𝐺)))
64	45	fveq2d 6846	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐹) = ((𝐴 CNF 𝐵)‘𝐺))
65	56, 63, 64	3eqtr4rd 2787	. . 3 ⊢ ((𝜑 ∧ 𝑌 = ∅) → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺)))
66	47, 65	jca 512	. 2 ⊢ ((𝜑 ∧ 𝑌 = ∅) → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺))))
67	14	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝐴 ∈ On)
68	2	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝐵 ∈ On)
69	12	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝐺 ∈ 𝑆)
70	3	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝑋 ∈ 𝐵)
71		cantnfp1.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
72	71	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝑌 ∈ 𝐴)
73	27	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → (𝐺 supp ∅) ⊆ 𝑋)
74	13, 67, 68, 69, 70, 72, 73, 1	cantnfp1lem1 9614	. . 3 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → 𝐹 ∈ 𝑆)
75		onelon 6342	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ On)
76	14, 71, 75	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ On)
77		on0eln0 6373	. . . . . 6 ⊢ (𝑌 ∈ On → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
78	76, 77	syl 17	. . . . 5 ⊢ (𝜑 → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
79	78	biimpar 478	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → ∅ ∈ 𝑌)
80		eqid 2736	. . . 4 ⊢ OrdIso( E , (𝐹 supp ∅)) = OrdIso( E , (𝐹 supp ∅))
81		eqid 2736	. . . 4 ⊢ seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝐹 supp ∅))‘𝑘)) ·_o (𝐹‘(OrdIso( E , (𝐹 supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝐹 supp ∅))‘𝑘)) ·_o (𝐹‘(OrdIso( E , (𝐹 supp ∅))‘𝑘))) +_o 𝑧)), ∅)
82		eqid 2736	. . . 4 ⊢ OrdIso( E , (𝐺 supp ∅)) = OrdIso( E , (𝐺 supp ∅))
83		eqid 2736	. . . 4 ⊢ seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·_o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·_o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +_o 𝑧)), ∅)
84	13, 67, 68, 69, 70, 72, 73, 1, 79, 80, 81, 82, 83	cantnfp1lem3 9616	. . 3 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺)))
85	74, 84	jca 512	. 2 ⊢ ((𝜑 ∧ 𝑌 ≠ ∅) → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺))))
86	66, 85	pm2.61dane 3032	1 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o ((𝐴 CNF 𝐵)‘𝐺))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 Vcvv 3445 ∖ cdif 3907 ⊆ wss 3910 ∅c0 4282 ifcif 4486 class class class wbr 5105 ↦ cmpt 5188 E cep 5536 dom cdm 5633 Ord word 6316 Oncon0 6317 Fn wfn 6491 ⟶wf 6492 ‘cfv 6496 (class class class)co 7357 ∈ cmpo 7359 supp csupp 8092 seq_ωcseqom 8393 1_oc1o 8405 +_o coa 8409 ·_o comu 8410 ↑_o coe 8411 finSupp cfsupp 9305 OrdIsocoi 9445 CNF ccnf 9597

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-1st 7921 df-2nd 7922 df-supp 8093 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-seqom 8394 df-1o 8412 df-2o 8413 df-oadd 8416 df-omul 8417 df-oexp 8418 df-er 8648 df-map 8767 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9306 df-oi 9446 df-cnf 9598

This theorem is referenced by: cantnflem1d 9624 cantnflem1 9625 cantnflem3 9627 cantnfresb 41644

W3C validator