isf32lem6 - Metamath Proof Explorer

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

Theorem isf32lem6 10353

Description: Lemma for isfin3-2 10362. Each K value is nonempty. (Contributed by Stefan O'Rear, 5-Nov-2014.)

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

**Assertion**
Ref	Expression
isf32lem6	⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐾‘𝐴) ≠ ∅)

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

**Proof of Theorem isf32lem6**
Step	Hyp	Ref	Expression
1		isf32lem.f	. . . 4 ⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)
2	1	fveq1i 6893	. . 3 ⊢ (𝐾‘𝐴) = (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴)
3		isf32lem.d	. . . . . . . 8 ⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)}
4	3	ssrab3 4081	. . . . . . 7 ⊢ 𝑆 ⊆ ω
5		isf32lem.a	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺)
6		isf32lem.b	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥))
7		isf32lem.c	. . . . . . . 8 ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹)
8	5, 6, 7, 3	isf32lem5 10352	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑆 ∈ Fin)
9		isf32lem.e	. . . . . . . 8 ⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢))
10	9	fin23lem22 10322	. . . . . . 7 ⊢ ((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) → 𝐽:ω–1-1-onto→𝑆)
11	4, 8, 10	sylancr 588	. . . . . 6 ⊢ (𝜑 → 𝐽:ω–1-1-onto→𝑆)
12		f1of 6834	. . . . . 6 ⊢ (𝐽:ω–1-1-onto→𝑆 → 𝐽:ω⟶𝑆)
13	11, 12	syl 17	. . . . 5 ⊢ (𝜑 → 𝐽:ω⟶𝑆)
14		fvco3 6991	. . . . 5 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐴 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)))
15	13, 14	sylan 581	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)))
16	8	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → ¬ 𝑆 ∈ Fin)
17	4, 16, 10	sylancr 588	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → 𝐽:ω–1-1-onto→𝑆)
18	17, 12	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → 𝐽:ω⟶𝑆)
19		ffvelcdm 7084	. . . . . 6 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐴 ∈ ω) → (𝐽‘𝐴) ∈ 𝑆)
20	18, 19	sylancom 589	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐽‘𝐴) ∈ 𝑆)
21		fveq2 6892	. . . . . . 7 ⊢ (𝑤 = (𝐽‘𝐴) → (𝐹‘𝑤) = (𝐹‘(𝐽‘𝐴)))
22		suceq 6431	. . . . . . . 8 ⊢ (𝑤 = (𝐽‘𝐴) → suc 𝑤 = suc (𝐽‘𝐴))
23	22	fveq2d 6896	. . . . . . 7 ⊢ (𝑤 = (𝐽‘𝐴) → (𝐹‘suc 𝑤) = (𝐹‘suc (𝐽‘𝐴)))
24	21, 23	difeq12d 4124	. . . . . 6 ⊢ (𝑤 = (𝐽‘𝐴) → ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
25		eqid 2733	. . . . . 6 ⊢ (𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) = (𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))
26		fvex 6905	. . . . . . 7 ⊢ (𝐹‘(𝐽‘𝐴)) ∈ V
27	26	difexi 5329	. . . . . 6 ⊢ ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ∈ V
28	24, 25, 27	fvmpt 6999	. . . . 5 ⊢ ((𝐽‘𝐴) ∈ 𝑆 → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
29	20, 28	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
30	15, 29	eqtrd 2773	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
31	2, 30	eqtrid 2785	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐾‘𝐴) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
32		suceq 6431	. . . . . . . . 9 ⊢ (𝑦 = (𝐽‘𝐴) → suc 𝑦 = suc (𝐽‘𝐴))
33	32	fveq2d 6896	. . . . . . . 8 ⊢ (𝑦 = (𝐽‘𝐴) → (𝐹‘suc 𝑦) = (𝐹‘suc (𝐽‘𝐴)))
34		fveq2 6892	. . . . . . . 8 ⊢ (𝑦 = (𝐽‘𝐴) → (𝐹‘𝑦) = (𝐹‘(𝐽‘𝐴)))
35	33, 34	psseq12d 4095	. . . . . . 7 ⊢ (𝑦 = (𝐽‘𝐴) → ((𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦) ↔ (𝐹‘suc (𝐽‘𝐴)) ⊊ (𝐹‘(𝐽‘𝐴))))
36	35, 3	elrab2 3687	. . . . . 6 ⊢ ((𝐽‘𝐴) ∈ 𝑆 ↔ ((𝐽‘𝐴) ∈ ω ∧ (𝐹‘suc (𝐽‘𝐴)) ⊊ (𝐹‘(𝐽‘𝐴))))
37	36	simprbi 498	. . . . 5 ⊢ ((𝐽‘𝐴) ∈ 𝑆 → (𝐹‘suc (𝐽‘𝐴)) ⊊ (𝐹‘(𝐽‘𝐴)))
38	20, 37	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐹‘suc (𝐽‘𝐴)) ⊊ (𝐹‘(𝐽‘𝐴)))
39		df-pss 3968	. . . 4 ⊢ ((𝐹‘suc (𝐽‘𝐴)) ⊊ (𝐹‘(𝐽‘𝐴)) ↔ ((𝐹‘suc (𝐽‘𝐴)) ⊆ (𝐹‘(𝐽‘𝐴)) ∧ (𝐹‘suc (𝐽‘𝐴)) ≠ (𝐹‘(𝐽‘𝐴))))
40	38, 39	sylib 217	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → ((𝐹‘suc (𝐽‘𝐴)) ⊆ (𝐹‘(𝐽‘𝐴)) ∧ (𝐹‘suc (𝐽‘𝐴)) ≠ (𝐹‘(𝐽‘𝐴))))
41		pssdifn0 4366	. . 3 ⊢ (((𝐹‘suc (𝐽‘𝐴)) ⊆ (𝐹‘(𝐽‘𝐴)) ∧ (𝐹‘suc (𝐽‘𝐴)) ≠ (𝐹‘(𝐽‘𝐴))) → ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ≠ ∅)
42	40, 41	syl 17	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ≠ ∅)
43	31, 42	eqnetrd 3009	1 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (𝐾‘𝐴) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 {crab 3433 ∖ cdif 3946 ∩ cin 3948 ⊆ wss 3949 ⊊ wpss 3950 ∅c0 4323 𝒫 cpw 4603 ∩ cint 4951 class class class wbr 5149 ↦ cmpt 5232 ran crn 5678 ∘ ccom 5681 suc csuc 6367 ⟶wf 6540 –1-1-onto→wf1o 6543 ‘cfv 6544 ℩crio 7364 ωcom 7855 ≈ cen 8936 Fincfn 8939

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

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-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-op 4636 df-uni 4910 df-int 4952 df-iun 5000 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-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9934

This theorem is referenced by: isf32lem9 10356

W3C validator