isf32lem7 - Metamath Proof Explorer

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

Theorem isf32lem7 10356

Description: Lemma for isfin3-2 10364. Different K values are disjoint. (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
isf32lem7	⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐾‘𝐴) ∩ (𝐾‘𝐵)) = ∅)

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

**Proof of Theorem isf32lem7**
Step	Hyp	Ref	Expression
1		isf32lem.f	. . . . 5 ⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)
2	1	fveq1i 6892	. . . 4 ⊢ (𝐾‘𝐴) = (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴)
3		isf32lem.d	. . . . . . . . . 10 ⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)}
4	3	ssrab3 4080	. . . . . . . . 9 ⊢ 𝑆 ⊆ ω
5		isf32lem.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺)
6		isf32lem.b	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥))
7		isf32lem.c	. . . . . . . . . 10 ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹)
8	5, 6, 7, 3	isf32lem5 10354	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑆 ∈ Fin)
9		isf32lem.e	. . . . . . . . . 10 ⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢))
10	9	fin23lem22 10324	. . . . . . . . 9 ⊢ ((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) → 𝐽:ω–1-1-onto→𝑆)
11	4, 8, 10	sylancr 587	. . . . . . . 8 ⊢ (𝜑 → 𝐽:ω–1-1-onto→𝑆)
12		f1of 6833	. . . . . . . 8 ⊢ (𝐽:ω–1-1-onto→𝑆 → 𝐽:ω⟶𝑆)
13	11, 12	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐽:ω⟶𝑆)
14		fvco3 6990	. . . . . . 7 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐴 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)))
15	13, 14	sylan 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)))
16	15	ad2ant2r 745	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)))
17	13	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐽:ω⟶𝑆)
18		simpl 483	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 ∈ ω)
19		ffvelcdm 7083	. . . . . . 7 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐴 ∈ ω) → (𝐽‘𝐴) ∈ 𝑆)
20	17, 18, 19	syl2an 596	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐽‘𝐴) ∈ 𝑆)
21		fveq2 6891	. . . . . . . 8 ⊢ (𝑤 = (𝐽‘𝐴) → (𝐹‘𝑤) = (𝐹‘(𝐽‘𝐴)))
22		suceq 6430	. . . . . . . . 9 ⊢ (𝑤 = (𝐽‘𝐴) → suc 𝑤 = suc (𝐽‘𝐴))
23	22	fveq2d 6895	. . . . . . . 8 ⊢ (𝑤 = (𝐽‘𝐴) → (𝐹‘suc 𝑤) = (𝐹‘suc (𝐽‘𝐴)))
24	21, 23	difeq12d 4123	. . . . . . 7 ⊢ (𝑤 = (𝐽‘𝐴) → ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
25		eqid 2732	. . . . . . 7 ⊢ (𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) = (𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))
26		fvex 6904	. . . . . . . 8 ⊢ (𝐹‘(𝐽‘𝐴)) ∈ V
27	26	difexi 5328	. . . . . . 7 ⊢ ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ∈ V
28	24, 25, 27	fvmpt 6998	. . . . . 6 ⊢ ((𝐽‘𝐴) ∈ 𝑆 → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
29	20, 28	syl 17	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐴)) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
30	16, 29	eqtrd 2772	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐴) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
31	2, 30	eqtrid 2784	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐾‘𝐴) = ((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))))
32	1	fveq1i 6892	. . . 4 ⊢ (𝐾‘𝐵) = (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐵)
33		fvco3 6990	. . . . . . 7 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐵 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐵) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐵)))
34	13, 33	sylan 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ ω) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐵) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐵)))
35	34	ad2ant2rl 747	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐵) = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐵)))
36		simpr 485	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 ∈ ω)
37		ffvelcdm 7083	. . . . . . 7 ⊢ ((𝐽:ω⟶𝑆 ∧ 𝐵 ∈ ω) → (𝐽‘𝐵) ∈ 𝑆)
38	17, 36, 37	syl2an 596	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐽‘𝐵) ∈ 𝑆)
39		fveq2 6891	. . . . . . . 8 ⊢ (𝑤 = (𝐽‘𝐵) → (𝐹‘𝑤) = (𝐹‘(𝐽‘𝐵)))
40		suceq 6430	. . . . . . . . 9 ⊢ (𝑤 = (𝐽‘𝐵) → suc 𝑤 = suc (𝐽‘𝐵))
41	40	fveq2d 6895	. . . . . . . 8 ⊢ (𝑤 = (𝐽‘𝐵) → (𝐹‘suc 𝑤) = (𝐹‘suc (𝐽‘𝐵)))
42	39, 41	difeq12d 4123	. . . . . . 7 ⊢ (𝑤 = (𝐽‘𝐵) → ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)) = ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))))
43		fvex 6904	. . . . . . . 8 ⊢ (𝐹‘(𝐽‘𝐵)) ∈ V
44	43	difexi 5328	. . . . . . 7 ⊢ ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))) ∈ V
45	42, 25, 44	fvmpt 6998	. . . . . 6 ⊢ ((𝐽‘𝐵) ∈ 𝑆 → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐵)) = ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))))
46	38, 45	syl 17	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤)))‘(𝐽‘𝐵)) = ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))))
47	35, 46	eqtrd 2772	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽)‘𝐵) = ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))))
48	32, 47	eqtrid 2784	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐾‘𝐵) = ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵))))
49	31, 48	ineq12d 4213	. 2 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐾‘𝐴) ∩ (𝐾‘𝐵)) = (((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ∩ ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵)))))
50		simpll 765	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝜑)
51		simplr 767	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → 𝐴 ≠ 𝐵)
52		f1of1 6832	. . . . . . . . 9 ⊢ (𝐽:ω–1-1-onto→𝑆 → 𝐽:ω–1-1→𝑆)
53	11, 52	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐽:ω–1-1→𝑆)
54	53	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → 𝐽:ω–1-1→𝑆)
55		f1fveq 7263	. . . . . . 7 ⊢ ((𝐽:ω–1-1→𝑆 ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐽‘𝐴) = (𝐽‘𝐵) ↔ 𝐴 = 𝐵))
56	54, 55	sylan 580	. . . . . 6 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐽‘𝐴) = (𝐽‘𝐵) ↔ 𝐴 = 𝐵))
57	56	biimpd 228	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐽‘𝐴) = (𝐽‘𝐵) → 𝐴 = 𝐵))
58	57	necon3d 2961	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐴 ≠ 𝐵 → (𝐽‘𝐴) ≠ (𝐽‘𝐵)))
59	51, 58	mpd 15	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐽‘𝐴) ≠ (𝐽‘𝐵))
60	4, 20	sselid 3980	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐽‘𝐴) ∈ ω)
61	4, 38	sselid 3980	. . 3 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (𝐽‘𝐵) ∈ ω)
62	5, 6, 7	isf32lem4 10353	. . 3 ⊢ (((𝜑 ∧ (𝐽‘𝐴) ≠ (𝐽‘𝐵)) ∧ ((𝐽‘𝐴) ∈ ω ∧ (𝐽‘𝐵) ∈ ω)) → (((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ∩ ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵)))) = ∅)
63	50, 59, 60, 61, 62	syl22anc 837	. 2 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → (((𝐹‘(𝐽‘𝐴)) ∖ (𝐹‘suc (𝐽‘𝐴))) ∩ ((𝐹‘(𝐽‘𝐵)) ∖ (𝐹‘suc (𝐽‘𝐵)))) = ∅)
64	49, 63	eqtrd 2772	1 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ ω ∧ 𝐵 ∈ ω)) → ((𝐾‘𝐴) ∩ (𝐾‘𝐵)) = ∅)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 {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 ⟶wf 6539 –1-1→wf1 6540 –1-1-onto→wf1o 6542 ‘cfv 6543 ℩crio 7366 ωcom 7857 ≈ cen 8938 Fincfn 8941

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: isf32lem9 10358

W3C validator