isf32lem9 - Metamath Proof Explorer

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

Theorem isf32lem9 10358

Description: Lemma for isfin3-2 10364. Construction of the onto function. (Contributed by Stefan O'Rear, 5-Nov-2014.) (Revised by Mario Carneiro, 2-Oct-2015.)

**Hypotheses**
Ref	Expression
isf32lem.a	⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺)
isf32lem.b	⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥))
isf32lem.c	⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹)
isf32lem.d	⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)}
isf32lem.e	⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢))
isf32lem.f	⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)
isf32lem.g	⊢ 𝐿 = (𝑡 ∈ 𝐺 ↦ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))))

**Assertion**
Ref	Expression
isf32lem9	⊢ (𝜑 → 𝐿:𝐺–onto→ω)

Distinct variable groups: 𝑥,𝑤 𝑡,𝐺 𝑥,𝐿 𝑡,𝑠,𝑢,𝑣,𝑤,𝑥,𝑦,𝜑 𝑤,𝐹,𝑥,𝑦 𝑆,𝑠,𝑡,𝑢,𝑣,𝑤,𝑥,𝑦 𝐽,𝑠,𝑡,𝑤,𝑥,𝑦 𝐾,𝑠,𝑡,𝑥,𝑦 Allowed substitution hints: 𝐹(𝑣,𝑢,𝑡,𝑠) 𝐺(𝑥,𝑦,𝑤,𝑣,𝑢,𝑠) 𝐽(𝑣,𝑢) 𝐾(𝑤,𝑣,𝑢) 𝐿(𝑦,𝑤,𝑣,𝑢,𝑡,𝑠)

Proof of Theorem isf32lem9 Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isf32lem.g	. . . 4 ⊢ 𝐿 = (𝑡 ∈ 𝐺 ↦ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))))
2		ssab2 4076	. . . . . . 7 ⊢ {𝑠 ∣ (𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))} ⊆ ω
3		iotacl 6529	. . . . . . 7 ⊢ (∃!𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)) → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ {𝑠 ∣ (𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))})
4	2, 3	sselid 3980	. . . . . 6 ⊢ (∃!𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)) → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ ω)
5		iotanul 6521	. . . . . . 7 ⊢ (¬ ∃!𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)) → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) = ∅)
6		peano1 7881	. . . . . . 7 ⊢ ∅ ∈ ω
7	5, 6	eqeltrdi 2841	. . . . . 6 ⊢ (¬ ∃!𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)) → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ ω)
8	4, 7	pm2.61i 182	. . . . 5 ⊢ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ ω
9	8	a1i 11	. . . 4 ⊢ (𝑡 ∈ 𝐺 → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ ω)
10	1, 9	fmpti 7113	. . 3 ⊢ 𝐿:𝐺⟶ω
11	10	a1i 11	. 2 ⊢ (𝜑 → 𝐿:𝐺⟶ω)
12		isf32lem.a	. . . . . 6 ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺)
13		isf32lem.b	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥))
14		isf32lem.c	. . . . . 6 ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹)
15		isf32lem.d	. . . . . 6 ⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)}
16		isf32lem.e	. . . . . 6 ⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢))
17		isf32lem.f	. . . . . 6 ⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)
18	12, 13, 14, 15, 16, 17	isf32lem6 10355	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → (𝐾‘𝑎) ≠ ∅)
19		n0 4346	. . . . 5 ⊢ ((𝐾‘𝑎) ≠ ∅ ↔ ∃𝑏 𝑏 ∈ (𝐾‘𝑎))
20	18, 19	sylib 217	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → ∃𝑏 𝑏 ∈ (𝐾‘𝑎))
21	12, 13, 14, 15, 16, 17	isf32lem8 10357	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → (𝐾‘𝑎) ⊆ 𝐺)
22	21	sselda 3982	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ ω) ∧ 𝑏 ∈ (𝐾‘𝑎)) → 𝑏 ∈ 𝐺)
23		eleq1w 2816	. . . . . . . . . . . . 13 ⊢ (𝑡 = 𝑏 → (𝑡 ∈ (𝐾‘𝑠) ↔ 𝑏 ∈ (𝐾‘𝑠)))
24	23	anbi2d 629	. . . . . . . . . . . 12 ⊢ (𝑡 = 𝑏 → ((𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)) ↔ (𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
25	24	iotabidv 6527	. . . . . . . . . . 11 ⊢ (𝑡 = 𝑏 → (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) = (℩𝑠(𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
26		iotaex 6516	. . . . . . . . . . 11 ⊢ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠))) ∈ V
27	25, 1, 26	fvmpt3i 7003	. . . . . . . . . 10 ⊢ (𝑏 ∈ 𝐺 → (𝐿‘𝑏) = (℩𝑠(𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
28	22, 27	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ ω) ∧ 𝑏 ∈ (𝐾‘𝑎)) → (𝐿‘𝑏) = (℩𝑠(𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
29		simp1r 1198	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → 𝑏 ∈ (𝐾‘𝑎))
30		simpl1 1191	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → 𝜑)
31		simpr 485	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → 𝑠 ≠ 𝑎)
32	31	necomd 2996	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → 𝑎 ≠ 𝑠)
33		simpl2 1192	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → 𝑎 ∈ ω)
34		simpl3 1193	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → 𝑠 ∈ ω)
35	12, 13, 14, 15, 16, 17	isf32lem7 10356	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑎 ≠ 𝑠) ∧ (𝑎 ∈ ω ∧ 𝑠 ∈ ω)) → ((𝐾‘𝑎) ∩ (𝐾‘𝑠)) = ∅)
36	30, 32, 33, 34, 35	syl22anc 837	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → ((𝐾‘𝑎) ∩ (𝐾‘𝑠)) = ∅)
37		disj1 4450	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐾‘𝑎) ∩ (𝐾‘𝑠)) = ∅ ↔ ∀𝑏(𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠)))
38	36, 37	sylib 217	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) ∧ 𝑠 ≠ 𝑎) → ∀𝑏(𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠)))
39	38	ex 413	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑠 ≠ 𝑎 → ∀𝑏(𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠))))
40		sp 2176	. . . . . . . . . . . . . . . . . . 19 ⊢ (∀𝑏(𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠)) → (𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠)))
41	39, 40	syl6 35	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑠 ≠ 𝑎 → (𝑏 ∈ (𝐾‘𝑎) → ¬ 𝑏 ∈ (𝐾‘𝑠))))
42	41	com23 86	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑏 ∈ (𝐾‘𝑎) → (𝑠 ≠ 𝑎 → ¬ 𝑏 ∈ (𝐾‘𝑠))))
43	42	3adant1r 1177	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑏 ∈ (𝐾‘𝑎) → (𝑠 ≠ 𝑎 → ¬ 𝑏 ∈ (𝐾‘𝑠))))
44	29, 43	mpd 15	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑠 ≠ 𝑎 → ¬ 𝑏 ∈ (𝐾‘𝑠)))
45	44	necon4ad 2959	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω ∧ 𝑠 ∈ ω) → (𝑏 ∈ (𝐾‘𝑠) → 𝑠 = 𝑎))
46	45	3expia 1121	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω) → (𝑠 ∈ ω → (𝑏 ∈ (𝐾‘𝑠) → 𝑠 = 𝑎)))
47	46	impd 411	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω) → ((𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠)) → 𝑠 = 𝑎))
48		eleq1w 2816	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑎 → (𝑠 ∈ ω ↔ 𝑎 ∈ ω))
49		fveq2 6891	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 = 𝑎 → (𝐾‘𝑠) = (𝐾‘𝑎))
50	49	eleq2d 2819	. . . . . . . . . . . . . . . 16 ⊢ (𝑠 = 𝑎 → (𝑏 ∈ (𝐾‘𝑠) ↔ 𝑏 ∈ (𝐾‘𝑎)))
51	48, 50	anbi12d 631	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = 𝑎 → ((𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠)) ↔ (𝑎 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑎))))
52	51	biimprcd 249	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑎)) → (𝑠 = 𝑎 → (𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
53	52	ancoms 459	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ (𝐾‘𝑎) ∧ 𝑎 ∈ ω) → (𝑠 = 𝑎 → (𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
54	53	adantll 712	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω) → (𝑠 = 𝑎 → (𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))))
55	47, 54	impbid 211	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω) → ((𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠)) ↔ 𝑠 = 𝑎))
56	55	iota5 6526	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ∈ (𝐾‘𝑎)) ∧ 𝑎 ∈ ω) → (℩𝑠(𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))) = 𝑎)
57	56	an32s 650	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ ω) ∧ 𝑏 ∈ (𝐾‘𝑎)) → (℩𝑠(𝑠 ∈ ω ∧ 𝑏 ∈ (𝐾‘𝑠))) = 𝑎)
58	28, 57	eqtr2d 2773	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ ω) ∧ 𝑏 ∈ (𝐾‘𝑎)) → 𝑎 = (𝐿‘𝑏))
59	22, 58	jca 512	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ ω) ∧ 𝑏 ∈ (𝐾‘𝑎)) → (𝑏 ∈ 𝐺 ∧ 𝑎 = (𝐿‘𝑏)))
60	59	ex 413	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → (𝑏 ∈ (𝐾‘𝑎) → (𝑏 ∈ 𝐺 ∧ 𝑎 = (𝐿‘𝑏))))
61	60	eximdv 1920	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → (∃𝑏 𝑏 ∈ (𝐾‘𝑎) → ∃𝑏(𝑏 ∈ 𝐺 ∧ 𝑎 = (𝐿‘𝑏))))
62		df-rex 3071	. . . . 5 ⊢ (∃𝑏 ∈ 𝐺 𝑎 = (𝐿‘𝑏) ↔ ∃𝑏(𝑏 ∈ 𝐺 ∧ 𝑎 = (𝐿‘𝑏)))
63	61, 62	imbitrrdi 251	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → (∃𝑏 𝑏 ∈ (𝐾‘𝑎) → ∃𝑏 ∈ 𝐺 𝑎 = (𝐿‘𝑏)))
64	20, 63	mpd 15	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ ω) → ∃𝑏 ∈ 𝐺 𝑎 = (𝐿‘𝑏))
65	64	ralrimiva 3146	. 2 ⊢ (𝜑 → ∀𝑎 ∈ ω ∃𝑏 ∈ 𝐺 𝑎 = (𝐿‘𝑏))
66		dffo3 7103	. 2 ⊢ (𝐿:𝐺–onto→ω ↔ (𝐿:𝐺⟶ω ∧ ∀𝑎 ∈ ω ∃𝑏 ∈ 𝐺 𝑎 = (𝐿‘𝑏)))
67	11, 65, 66	sylanbrc 583	1 ⊢ (𝜑 → 𝐿:𝐺–onto→ω)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1087 ∀wal 1539 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∃!weu 2562 {cab 2709 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 {crab 3432 ∖ cdif 3945 ∩ cin 3947 ⊆ wss 3948 ⊊ wpss 3949 ∅c0 4322 𝒫 cpw 4602 ∩ cint 4950 class class class wbr 5148 ↦ cmpt 5231 ran crn 5677 ∘ ccom 5680 suc csuc 6366 ℩cio 6493 ⟶wf 6539 –onto→wfo 6541 ‘cfv 6543 ℩crio 7366 ωcom 7857 ≈ cen 8938

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 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727

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 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 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-op 4635 df-uni 4909 df-int 4951 df-iun 4999 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 7367 df-ov 7414 df-om 7858 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9936

This theorem is referenced by: isf32lem10 10359

W3C validator