efgsfo - Metamath Proof Explorer

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

Theorem efgsfo 18359

Description: For any word, there is a sequence of extensions starting at a reduced word and ending at the target word, such that each word in the chain is an extension of the previous (inserting an element and its inverse at adjacent indexes somewhere in the sequence). (Contributed by Mario Carneiro, 27-Sep-2015.)

**Hypotheses**
Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2_𝑜))
efgval.r	⊢ ∼ = ( ~_FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_𝑜 ↦ ⟨𝑦, (1_𝑜 ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_𝑜) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
efgred.d	⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
efgred.s	⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))

**Assertion**
Ref	Expression
efgsfo	⊢ 𝑆:dom 𝑆–onto→𝑊

Distinct variable groups: 𝑦,𝑧 𝑡,𝑛,𝑣,𝑤,𝑦,𝑧,𝑚,𝑥 𝑚,𝑀 𝑥,𝑛,𝑀,𝑡,𝑣,𝑤 𝑘,𝑚,𝑡,𝑥,𝑇 𝑘,𝑛,𝑣,𝑤,𝑦,𝑧,𝑊,𝑚,𝑡,𝑥 ∼ ,𝑚,𝑡,𝑥,𝑦,𝑧 𝑚,𝐼,𝑛,𝑡,𝑣,𝑤,𝑥,𝑦,𝑧 𝐷,𝑚,𝑡 Allowed substitution hints: 𝐷(𝑥,𝑦,𝑧,𝑤,𝑣,𝑘,𝑛) ∼ (𝑤,𝑣,𝑘,𝑛) 𝑆(𝑥,𝑦,𝑧,𝑤,𝑣,𝑡,𝑘,𝑚,𝑛) 𝑇(𝑦,𝑧,𝑤,𝑣,𝑛) 𝐼(𝑘) 𝑀(𝑦,𝑧,𝑘)

Proof of Theorem efgsfo Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑖 𝑜 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		efgval.w	. . . 4 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2_𝑜))
2		efgval.r	. . . 4 ⊢ ∼ = ( ~_FG ‘𝐼)
3		efgval2.m	. . . 4 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_𝑜 ↦ ⟨𝑦, (1_𝑜 ∖ 𝑧)⟩)
4		efgval2.t	. . . 4 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_𝑜) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
5		efgred.d	. . . 4 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
6		efgred.s	. . . 4 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
7	1, 2, 3, 4, 5, 6	efgsf 18349	. . 3 ⊢ 𝑆:{𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}⟶𝑊
8	7	fdmi 6192	. . . 4 ⊢ dom 𝑆 = {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}
9	8	feq2i 6177	. . 3 ⊢ (𝑆:dom 𝑆⟶𝑊 ↔ 𝑆:{𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}⟶𝑊)
10	7, 9	mpbir 221	. 2 ⊢ 𝑆:dom 𝑆⟶𝑊
11		frn 6193	. . . 4 ⊢ (𝑆:dom 𝑆⟶𝑊 → ran 𝑆 ⊆ 𝑊)
12	10, 11	ax-mp 5	. . 3 ⊢ ran 𝑆 ⊆ 𝑊
13		fviss 6398	. . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2_𝑜)) ⊆ Word (𝐼 × 2_𝑜)
14	1, 13	eqsstri 3784	. . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2_𝑜)
15	14	sseli 3748	. . . . . . 7 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ Word (𝐼 × 2_𝑜))
16		lencl 13520	. . . . . . 7 ⊢ (𝑐 ∈ Word (𝐼 × 2_𝑜) → (♯‘𝑐) ∈ ℕ₀)
17	15, 16	syl 17	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) ∈ ℕ₀)
18		peano2nn0 11535	. . . . . 6 ⊢ ((♯‘𝑐) ∈ ℕ₀ → ((♯‘𝑐) + 1) ∈ ℕ₀)
19	14	sseli 3748	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ 𝑊 → 𝑎 ∈ Word (𝐼 × 2_𝑜))
20		lencl 13520	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ Word (𝐼 × 2_𝑜) → (♯‘𝑎) ∈ ℕ₀)
21	19, 20	syl 17	. . . . . . . . . . 11 ⊢ (𝑎 ∈ 𝑊 → (♯‘𝑎) ∈ ℕ₀)
22		nn0nlt0 11521	. . . . . . . . . . . 12 ⊢ ((♯‘𝑎) ∈ ℕ₀ → ¬ (♯‘𝑎) < 0)
23		breq2 4790	. . . . . . . . . . . . 13 ⊢ (𝑏 = 0 → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < 0))
24	23	notbid 307	. . . . . . . . . . . 12 ⊢ (𝑏 = 0 → (¬ (♯‘𝑎) < 𝑏 ↔ ¬ (♯‘𝑎) < 0))
25	22, 24	syl5ibr 236	. . . . . . . . . . 11 ⊢ (𝑏 = 0 → ((♯‘𝑎) ∈ ℕ₀ → ¬ (♯‘𝑎) < 𝑏))
26	21, 25	syl5 34	. . . . . . . . . 10 ⊢ (𝑏 = 0 → (𝑎 ∈ 𝑊 → ¬ (♯‘𝑎) < 𝑏))
27	26	ralrimiv 3114	. . . . . . . . 9 ⊢ (𝑏 = 0 → ∀𝑎 ∈ 𝑊 ¬ (♯‘𝑎) < 𝑏)
28		rabeq0 4103	. . . . . . . . 9 ⊢ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = ∅ ↔ ∀𝑎 ∈ 𝑊 ¬ (♯‘𝑎) < 𝑏)
29	27, 28	sylibr 224	. . . . . . . 8 ⊢ (𝑏 = 0 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = ∅)
30	29	sseq1d 3781	. . . . . . 7 ⊢ (𝑏 = 0 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ ∅ ⊆ ran 𝑆))
31		breq2 4790	. . . . . . . . 9 ⊢ (𝑏 = 𝑑 → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < 𝑑))
32	31	rabbidv 3339	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑})
33	32	sseq1d 3781	. . . . . . 7 ⊢ (𝑏 = 𝑑 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆))
34		breq2 4790	. . . . . . . . 9 ⊢ (𝑏 = (𝑑 + 1) → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < (𝑑 + 1)))
35	34	rabbidv 3339	. . . . . . . 8 ⊢ (𝑏 = (𝑑 + 1) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)})
36	35	sseq1d 3781	. . . . . . 7 ⊢ (𝑏 = (𝑑 + 1) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆))
37		breq2 4790	. . . . . . . . 9 ⊢ (𝑏 = ((♯‘𝑐) + 1) → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < ((♯‘𝑐) + 1)))
38	37	rabbidv 3339	. . . . . . . 8 ⊢ (𝑏 = ((♯‘𝑐) + 1) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)})
39	38	sseq1d 3781	. . . . . . 7 ⊢ (𝑏 = ((♯‘𝑐) + 1) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆))
40		0ss 4116	. . . . . . 7 ⊢ ∅ ⊆ ran 𝑆
41		simpr 471	. . . . . . . . . 10 ⊢ ((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆)
42		fveq2 6332	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑐 → (♯‘𝑎) = (♯‘𝑐))
43	42	eqeq1d 2773	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑐 → ((♯‘𝑎) = 𝑑 ↔ (♯‘𝑐) = 𝑑))
44	43	cbvrabv 3349	. . . . . . . . . . 11 ⊢ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑} = {𝑐 ∈ 𝑊 ∣ (♯‘𝑐) = 𝑑}
45		eliun 4658	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) ↔ ∃𝑥 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑥))
46		fveq2 6332	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑏 → (𝑇‘𝑥) = (𝑇‘𝑏))
47	46	rneqd 5491	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑏 → ran (𝑇‘𝑥) = ran (𝑇‘𝑏))
48	47	eleq2d 2836	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑏 → (𝑐 ∈ ran (𝑇‘𝑥) ↔ 𝑐 ∈ ran (𝑇‘𝑏)))
49	48	cbvrexv 3321	. . . . . . . . . . . . . . 15 ⊢ (∃𝑥 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑥) ↔ ∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏))
50	45, 49	bitri 264	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) ↔ ∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏))
51		simpl1r 1280	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆)
52		simprl 754	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ 𝑊)
53	14, 52	sseldi 3750	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ Word (𝐼 × 2_𝑜))
54		lencl 13520	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑏 ∈ Word (𝐼 × 2_𝑜) → (♯‘𝑏) ∈ ℕ₀)
55	53, 54	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) ∈ ℕ₀)
56	55	nn0red 11554	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) ∈ ℝ)
57		2rp 12040	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 2 ∈ ℝ⁺
58		ltaddrp 12070	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((♯‘𝑏) ∈ ℝ ∧ 2 ∈ ℝ⁺) → (♯‘𝑏) < ((♯‘𝑏) + 2))
59	56, 57, 58	sylancl 574	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) < ((♯‘𝑏) + 2))
60	1, 2, 3, 4	efgtlen 18346	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) → (♯‘𝑐) = ((♯‘𝑏) + 2))
61	60	adantl 467	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑐) = ((♯‘𝑏) + 2))
62		simpl3 1231	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑐) = 𝑑)
63	61, 62	eqtr3d 2807	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → ((♯‘𝑏) + 2) = 𝑑)
64	59, 63	breqtrd 4812	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) < 𝑑)
65		fveq2 6332	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑎 = 𝑏 → (♯‘𝑎) = (♯‘𝑏))
66	65	breq1d 4796	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑏 → ((♯‘𝑎) < 𝑑 ↔ (♯‘𝑏) < 𝑑))
67	66	elrab 3515	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ↔ (𝑏 ∈ 𝑊 ∧ (♯‘𝑏) < 𝑑))
68	52, 64, 67	sylanbrc 572	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑})
69	51, 68	sseldd 3753	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ ran 𝑆)
70		ffn 6185	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆:dom 𝑆⟶𝑊 → 𝑆 Fn dom 𝑆)
71	10, 70	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑆 Fn dom 𝑆
72		fvelrnb 6385	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 Fn dom 𝑆 → (𝑏 ∈ ran 𝑆 ↔ ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏))
73	71, 72	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ ran 𝑆 ↔ ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏)
74	69, 73	sylib 208	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏)
75		simprrl 766	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑜 ∈ dom 𝑆)
76	1, 2, 3, 4, 5, 6	efgsdm 18350	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑜 ∈ dom 𝑆 ↔ (𝑜 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝑜‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(♯‘𝑜))(𝑜‘𝑖) ∈ ran (𝑇‘(𝑜‘(𝑖 − 1)))))
77	76	simp1bi 1139	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ dom 𝑆 → 𝑜 ∈ (Word 𝑊 ∖ {∅}))
78		eldifi 3883	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ (Word 𝑊 ∖ {∅}) → 𝑜 ∈ Word 𝑊)
79	75, 77, 78	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑜 ∈ Word 𝑊)
80		simpl2 1229	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ 𝑊)
81		simprlr 765	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran (𝑇‘𝑏))
82		simprrr 767	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘𝑜) = 𝑏)
83	82	fveq2d 6336	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑇‘(𝑆‘𝑜)) = (𝑇‘𝑏))
84	83	rneqd 5491	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → ran (𝑇‘(𝑆‘𝑜)) = ran (𝑇‘𝑏))
85	81, 84	eleqtrrd 2853	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran (𝑇‘(𝑆‘𝑜)))
86	1, 2, 3, 4, 5, 6	efgsp1 18357	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑜 ∈ dom 𝑆 ∧ 𝑐 ∈ ran (𝑇‘(𝑆‘𝑜))) → (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆)
87	75, 85, 86	syl2anc 573	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆)
88	1, 2, 3, 4, 5, 6	efgsval2 18353	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑜 ∈ Word 𝑊 ∧ 𝑐 ∈ 𝑊 ∧ (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) = 𝑐)
89	79, 80, 87, 88	syl3anc 1476	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) = 𝑐)
90		fnfvelrn 6499	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑆 Fn dom 𝑆 ∧ (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) ∈ ran 𝑆)
91	71, 87, 90	sylancr 575	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) ∈ ran 𝑆)
92	89, 91	eqeltrrd 2851	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran 𝑆)
93	92	anassrs 458	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏)) → 𝑐 ∈ ran 𝑆)
94	74, 93	rexlimddv 3183	. . . . . . . . . . . . . . 15 ⊢ ((((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑐 ∈ ran 𝑆)
95	94	rexlimdvaa 3180	. . . . . . . . . . . . . 14 ⊢ (((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏) → 𝑐 ∈ ran 𝑆))
96	50, 95	syl5bi 232	. . . . . . . . . . . . 13 ⊢ (((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
97		eldif 3733	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) ↔ (𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)))
98	5	eleq2i 2842	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ∈ 𝐷 ↔ 𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)))
99	1, 2, 3, 4, 5, 6	efgs1 18355	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ∈ 𝐷 → ⟨“𝑐”⟩ ∈ dom 𝑆)
100	98, 99	sylbir 225	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → ⟨“𝑐”⟩ ∈ dom 𝑆)
101	97, 100	sylbir 225	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → ⟨“𝑐”⟩ ∈ dom 𝑆)
102	1, 2, 3, 4, 5, 6	efgsval 18351	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨“𝑐”⟩ ∈ dom 𝑆 → (𝑆‘⟨“𝑐”⟩) = (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)))
103	101, 102	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) = (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)))
104		s1len 13586	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (♯‘⟨“𝑐”⟩) = 1
105	104	oveq1i 6803	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘⟨“𝑐”⟩) − 1) = (1 − 1)
106		1m1e0 11291	. . . . . . . . . . . . . . . . . . . 20 ⊢ (1 − 1) = 0
107	105, 106	eqtri 2793	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘⟨“𝑐”⟩) − 1) = 0
108	107	fveq2i 6335	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)) = (⟨“𝑐”⟩‘0)
109	108	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)) = (⟨“𝑐”⟩‘0))
110		s1fv 13590	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑐 ∈ 𝑊 → (⟨“𝑐”⟩‘0) = 𝑐)
111	110	adantr 466	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (⟨“𝑐”⟩‘0) = 𝑐)
112	103, 109, 111	3eqtrd 2809	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) = 𝑐)
113		fnfvelrn 6499	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑆 Fn dom 𝑆 ∧ ⟨“𝑐”⟩ ∈ dom 𝑆) → (𝑆‘⟨“𝑐”⟩) ∈ ran 𝑆)
114	71, 101, 113	sylancr 575	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) ∈ ran 𝑆)
115	112, 114	eqeltrrd 2851	. . . . . . . . . . . . . . 15 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → 𝑐 ∈ ran 𝑆)
116	115	ex 397	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ 𝑊 → (¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
117	116	3ad2ant2 1128	. . . . . . . . . . . . 13 ⊢ (((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
118	96, 117	pm2.61d 171	. . . . . . . . . . . 12 ⊢ (((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → 𝑐 ∈ ran 𝑆)
119	118	rabssdv 3831	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑐 ∈ 𝑊 ∣ (♯‘𝑐) = 𝑑} ⊆ ran 𝑆)
120	44, 119	syl5eqss 3798	. . . . . . . . . 10 ⊢ ((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑} ⊆ ran 𝑆)
121	41, 120	unssd 3940	. . . . . . . . 9 ⊢ ((𝑑 ∈ ℕ₀ ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆)
122	121	ex 397	. . . . . . . 8 ⊢ (𝑑 ∈ ℕ₀ → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆))
123		id 22	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ₀ → 𝑑 ∈ ℕ₀)
124		nn0leltp1 11638	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑎) ∈ ℕ₀ ∧ 𝑑 ∈ ℕ₀) → ((♯‘𝑎) ≤ 𝑑 ↔ (♯‘𝑎) < (𝑑 + 1)))
125	21, 123, 124	syl2anr 584	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ ℕ₀ ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) ≤ 𝑑 ↔ (♯‘𝑎) < (𝑑 + 1)))
126	21	nn0red 11554	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑊 → (♯‘𝑎) ∈ ℝ)
127		nn0re 11503	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ₀ → 𝑑 ∈ ℝ)
128		leloe 10326	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑎) ∈ ℝ ∧ 𝑑 ∈ ℝ) → ((♯‘𝑎) ≤ 𝑑 ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
129	126, 127, 128	syl2anr 584	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ ℕ₀ ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) ≤ 𝑑 ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
130	125, 129	bitr3d 270	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ ℕ₀ ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) < (𝑑 + 1) ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
131	130	rabbidva 3338	. . . . . . . . . 10 ⊢ (𝑑 ∈ ℕ₀ → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} = {𝑎 ∈ 𝑊 ∣ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)})
132		unrab 4046	. . . . . . . . . 10 ⊢ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) = {𝑎 ∈ 𝑊 ∣ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)}
133	131, 132	syl6eqr 2823	. . . . . . . . 9 ⊢ (𝑑 ∈ ℕ₀ → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} = ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}))
134	133	sseq1d 3781	. . . . . . . 8 ⊢ (𝑑 ∈ ℕ₀ → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆 ↔ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆))
135	122, 134	sylibrd 249	. . . . . . 7 ⊢ (𝑑 ∈ ℕ₀ → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆))
136	30, 33, 36, 39, 40, 135	nn0ind 11674	. . . . . 6 ⊢ (((♯‘𝑐) + 1) ∈ ℕ₀ → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆)
137	17, 18, 136	3syl 18	. . . . 5 ⊢ (𝑐 ∈ 𝑊 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆)
138		id 22	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ 𝑊)
139	17	nn0red 11554	. . . . . . 7 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) ∈ ℝ)
140	139	ltp1d 11156	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) < ((♯‘𝑐) + 1))
141	42	breq1d 4796	. . . . . . 7 ⊢ (𝑎 = 𝑐 → ((♯‘𝑎) < ((♯‘𝑐) + 1) ↔ (♯‘𝑐) < ((♯‘𝑐) + 1)))
142	141	elrab 3515	. . . . . 6 ⊢ (𝑐 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ↔ (𝑐 ∈ 𝑊 ∧ (♯‘𝑐) < ((♯‘𝑐) + 1)))
143	138, 140, 142	sylanbrc 572	. . . . 5 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)})
144	137, 143	sseldd 3753	. . . 4 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ ran 𝑆)
145	144	ssriv 3756	. . 3 ⊢ 𝑊 ⊆ ran 𝑆
146	12, 145	eqssi 3768	. 2 ⊢ ran 𝑆 = 𝑊
147		dffo2 6260	. 2 ⊢ (𝑆:dom 𝑆–onto→𝑊 ↔ (𝑆:dom 𝑆⟶𝑊 ∧ ran 𝑆 = 𝑊))
148	10, 146, 147	mpbir2an 690	1 ⊢ 𝑆:dom 𝑆–onto→𝑊

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 382 ∨ wo 836 ∧ w3a 1071 = wceq 1631 ∈ wcel 2145 ∀wral 3061 ∃wrex 3062 {crab 3065 ∖ cdif 3720 ∪ cun 3721 ⊆ wss 3723 ∅c0 4063 {csn 4316 ⟨cop 4322 ⟨cotp 4324 ∪ ciun 4654 class class class wbr 4786 ↦ cmpt 4863 I cid 5156 × cxp 5247 dom cdm 5249 ran crn 5250 Fn wfn 6026 ⟶wf 6027 –onto→wfo 6029 ‘cfv 6031 (class class class)co 6793 ↦ cmpt2 6795 1_𝑜c1o 7706 2_𝑜c2o 7707 ℝcr 10137 0cc0 10138 1c1 10139 + caddc 10141 < clt 10276 ≤ cle 10277 − cmin 10468 2c2 11272 ℕ₀cn0 11494 ℝ⁺crp 12035 ...cfz 12533 ..^cfzo 12673 ♯chash 13321 Word cword 13487 ++ cconcat 13489 ⟨“cs1 13490 splice csplice 13492 ⟨“cs2 13795 ~_FG cefg 18326

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7096 ax-cnex 10194 ax-resscn 10195 ax-1cn 10196 ax-icn 10197 ax-addcl 10198 ax-addrcl 10199 ax-mulcl 10200 ax-mulrcl 10201 ax-mulcom 10202 ax-addass 10203 ax-mulass 10204 ax-distr 10205 ax-i2m1 10206 ax-1ne0 10207 ax-1rid 10208 ax-rnegex 10209 ax-rrecex 10210 ax-cnre 10211 ax-pre-lttri 10212 ax-pre-lttrn 10213 ax-pre-ltadd 10214 ax-pre-mulgt0 10215

This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-ot 4325 df-uni 4575 df-int 4612 df-iun 4656 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6754 df-ov 6796 df-oprab 6797 df-mpt2 6798 df-om 7213 df-1st 7315 df-2nd 7316 df-wrecs 7559 df-recs 7621 df-rdg 7659 df-1o 7713 df-2o 7714 df-oadd 7717 df-er 7896 df-map 8011 df-pm 8012 df-en 8110 df-dom 8111 df-sdom 8112 df-fin 8113 df-card 8965 df-pnf 10278 df-mnf 10279 df-xr 10280 df-ltxr 10281 df-le 10282 df-sub 10470 df-neg 10471 df-nn 11223 df-2 11281 df-n0 11495 df-z 11580 df-uz 11889 df-rp 12036 df-fz 12534 df-fzo 12674 df-hash 13322 df-word 13495 df-concat 13497 df-s1 13498 df-substr 13499 df-splice 13500 df-s2 13802

This theorem is referenced by: efgredlemc 18365 efgrelexlemb 18370 efgredeu 18372 efgred2 18373

W3C validator