Theorem efgsfo 19675

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 indices somewhere in the sequence). (Contributed by Mario Carneiro, 27-Sep-2015.)

Hypotheses

Ref	Expression
efgval.w	⊢ 𝑊 = ( I ‘Word (𝐼 × 2o))
efgval.r	⊢ ∼ = ( ~FG ‘𝐼)
efgval2.m	⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)
efgval2.t	⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 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 (𝐼 × 2o))
2		efgval.r	. . . 4 ⊢ ∼ = ( ~FG ‘𝐼)
3		efgval2.m	. . . 4 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)
4		efgval2.t	. . . 4 ⊢ 𝑇 = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤(𝑀‘𝑤)”⟩⟩)))
5		efgred.d	. . . 4 ⊢ 𝐷 = (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥))
6		efgred.s	. . . 4 ⊢ 𝑆 = (𝑚 ∈ {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))} ↦ (𝑚‘((♯‘𝑚) − 1)))
7	1, 2, 3, 4, 5, 6	efgsf 19665	. . 3 ⊢ 𝑆:{𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}⟶𝑊
8	7	fdmi 6701	. . . 4 ⊢ dom 𝑆 = {𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}
9	8	feq2i 6682	. . 3 ⊢ (𝑆:dom 𝑆⟶𝑊 ↔ 𝑆:{𝑡 ∈ (Word 𝑊 ∖ {∅}) ∣ ((𝑡‘0) ∈ 𝐷 ∧ ∀𝑘 ∈ (1..^(♯‘𝑡))(𝑡‘𝑘) ∈ ran (𝑇‘(𝑡‘(𝑘 − 1))))}⟶𝑊)
10	7, 9	mpbir 231	. 2 ⊢ 𝑆:dom 𝑆⟶𝑊
11		frn 6697	. . . 4 ⊢ (𝑆:dom 𝑆⟶𝑊 → ran 𝑆 ⊆ 𝑊)
12	10, 11	ax-mp 5	. . 3 ⊢ ran 𝑆 ⊆ 𝑊
13		fviss 6940	. . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o)
14	1, 13	eqsstri 3995	. . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2o)
15	14	sseli 3944	. . . . . . 7 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ Word (𝐼 × 2o))
16		lencl 14504	. . . . . . 7 ⊢ (𝑐 ∈ Word (𝐼 × 2o) → (♯‘𝑐) ∈ ℕ0)
17	15, 16	syl 17	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) ∈ ℕ0)
18		peano2nn0 12488	. . . . . 6 ⊢ ((♯‘𝑐) ∈ ℕ0 → ((♯‘𝑐) + 1) ∈ ℕ0)
19	14	sseli 3944	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ 𝑊 → 𝑎 ∈ Word (𝐼 × 2o))
20		lencl 14504	. . . . . . . . . . . 12 ⊢ (𝑎 ∈ Word (𝐼 × 2o) → (♯‘𝑎) ∈ ℕ0)
21	19, 20	syl 17	. . . . . . . . . . 11 ⊢ (𝑎 ∈ 𝑊 → (♯‘𝑎) ∈ ℕ0)
22		nn0nlt0 12474	. . . . . . . . . . . 12 ⊢ ((♯‘𝑎) ∈ ℕ0 → ¬ (♯‘𝑎) < 0)
23		breq2 5113	. . . . . . . . . . . . 13 ⊢ (𝑏 = 0 → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < 0))
24	23	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑏 = 0 → (¬ (♯‘𝑎) < 𝑏 ↔ ¬ (♯‘𝑎) < 0))
25	22, 24	imbitrrid 246	. . . . . . . . . . 11 ⊢ (𝑏 = 0 → ((♯‘𝑎) ∈ ℕ0 → ¬ (♯‘𝑎) < 𝑏))
26	21, 25	syl5 34	. . . . . . . . . 10 ⊢ (𝑏 = 0 → (𝑎 ∈ 𝑊 → ¬ (♯‘𝑎) < 𝑏))
27	26	ralrimiv 3125	. . . . . . . . 9 ⊢ (𝑏 = 0 → ∀𝑎 ∈ 𝑊 ¬ (♯‘𝑎) < 𝑏)
28		rabeq0 4353	. . . . . . . . 9 ⊢ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = ∅ ↔ ∀𝑎 ∈ 𝑊 ¬ (♯‘𝑎) < 𝑏)
29	27, 28	sylibr 234	. . . . . . . 8 ⊢ (𝑏 = 0 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = ∅)
30	29	sseq1d 3980	. . . . . . 7 ⊢ (𝑏 = 0 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ ∅ ⊆ ran 𝑆))
31		breq2 5113	. . . . . . . . 9 ⊢ (𝑏 = 𝑑 → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < 𝑑))
32	31	rabbidv 3416	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑})
33	32	sseq1d 3980	. . . . . . 7 ⊢ (𝑏 = 𝑑 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆))
34		breq2 5113	. . . . . . . . 9 ⊢ (𝑏 = (𝑑 + 1) → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < (𝑑 + 1)))
35	34	rabbidv 3416	. . . . . . . 8 ⊢ (𝑏 = (𝑑 + 1) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)})
36	35	sseq1d 3980	. . . . . . 7 ⊢ (𝑏 = (𝑑 + 1) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆))
37		breq2 5113	. . . . . . . . 9 ⊢ (𝑏 = ((♯‘𝑐) + 1) → ((♯‘𝑎) < 𝑏 ↔ (♯‘𝑎) < ((♯‘𝑐) + 1)))
38	37	rabbidv 3416	. . . . . . . 8 ⊢ (𝑏 = ((♯‘𝑐) + 1) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} = {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)})
39	38	sseq1d 3980	. . . . . . 7 ⊢ (𝑏 = ((♯‘𝑐) + 1) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑏} ⊆ ran 𝑆 ↔ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆))
40		0ss 4365	. . . . . . 7 ⊢ ∅ ⊆ ran 𝑆
41		simpr 484	. . . . . . . . . 10 ⊢ ((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆)
42		fveqeq2 6869	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑐 → ((♯‘𝑎) = 𝑑 ↔ (♯‘𝑐) = 𝑑))
43	42	cbvrabv 3419	. . . . . . . . . . 11 ⊢ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑} = {𝑐 ∈ 𝑊 ∣ (♯‘𝑐) = 𝑑}
44		eliun 4961	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) ↔ ∃𝑥 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑥))
45		fveq2 6860	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑏 → (𝑇‘𝑥) = (𝑇‘𝑏))
46	45	rneqd 5904	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑏 → ran (𝑇‘𝑥) = ran (𝑇‘𝑏))
47	46	eleq2d 2815	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑏 → (𝑐 ∈ ran (𝑇‘𝑥) ↔ 𝑐 ∈ ran (𝑇‘𝑏)))
48	47	cbvrexvw 3217	. . . . . . . . . . . . . . 15 ⊢ (∃𝑥 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑥) ↔ ∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏))
49	44, 48	bitri 275	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) ↔ ∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏))
50		simpl1r 1226	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆)
51		fveq2 6860	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑏 → (♯‘𝑎) = (♯‘𝑏))
52	51	breq1d 5119	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = 𝑏 → ((♯‘𝑎) < 𝑑 ↔ (♯‘𝑏) < 𝑑))
53		simprl 770	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ 𝑊)
54	14, 53	sselid 3946	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ Word (𝐼 × 2o))
55		lencl 14504	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑏 ∈ Word (𝐼 × 2o) → (♯‘𝑏) ∈ ℕ0)
56	54, 55	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) ∈ ℕ0)
57	56	nn0red 12510	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) ∈ ℝ)
58		2rp 12962	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 2 ∈ ℝ+
59		ltaddrp 12996	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((♯‘𝑏) ∈ ℝ ∧ 2 ∈ ℝ+) → (♯‘𝑏) < ((♯‘𝑏) + 2))
60	57, 58, 59	sylancl 586	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) < ((♯‘𝑏) + 2))
61	1, 2, 3, 4	efgtlen 19662	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) → (♯‘𝑐) = ((♯‘𝑏) + 2))
62	61	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑐) = ((♯‘𝑏) + 2))
63		simpl3 1194	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑐) = 𝑑)
64	62, 63	eqtr3d 2767	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → ((♯‘𝑏) + 2) = 𝑑)
65	60, 64	breqtrd 5135	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → (♯‘𝑏) < 𝑑)
66	52, 53, 65	elrabd 3663	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑})
67	50, 66	sseldd 3949	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑏 ∈ ran 𝑆)
68		ffn 6690	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆:dom 𝑆⟶𝑊 → 𝑆 Fn dom 𝑆)
69	10, 68	ax-mp 5	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑆 Fn dom 𝑆
70		fvelrnb 6923	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑆 Fn dom 𝑆 → (𝑏 ∈ ran 𝑆 ↔ ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏))
71	69, 70	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ ran 𝑆 ↔ ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏)
72	67, 71	sylib 218	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → ∃𝑜 ∈ dom 𝑆(𝑆‘𝑜) = 𝑏)
73		simprrl 780	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑜 ∈ dom 𝑆)
74	1, 2, 3, 4, 5, 6	efgsdm 19666	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑜 ∈ dom 𝑆 ↔ (𝑜 ∈ (Word 𝑊 ∖ {∅}) ∧ (𝑜‘0) ∈ 𝐷 ∧ ∀𝑖 ∈ (1..^(♯‘𝑜))(𝑜‘𝑖) ∈ ran (𝑇‘(𝑜‘(𝑖 − 1)))))
75	74	simp1bi 1145	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ dom 𝑆 → 𝑜 ∈ (Word 𝑊 ∖ {∅}))
76		eldifi 4096	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑜 ∈ (Word 𝑊 ∖ {∅}) → 𝑜 ∈ Word 𝑊)
77	73, 75, 76	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑜 ∈ Word 𝑊)
78		simpl2 1193	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ 𝑊)
79		simprlr 779	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran (𝑇‘𝑏))
80		simprrr 781	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘𝑜) = 𝑏)
81	80	fveq2d 6864	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑇‘(𝑆‘𝑜)) = (𝑇‘𝑏))
82	81	rneqd 5904	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → ran (𝑇‘(𝑆‘𝑜)) = ran (𝑇‘𝑏))
83	79, 82	eleqtrrd 2832	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran (𝑇‘(𝑆‘𝑜)))
84	1, 2, 3, 4, 5, 6	efgsp1 19673	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑜 ∈ dom 𝑆 ∧ 𝑐 ∈ ran (𝑇‘(𝑆‘𝑜))) → (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆)
85	73, 83, 84	syl2anc 584	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆)
86	1, 2, 3, 4, 5, 6	efgsval2 19669	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑜 ∈ Word 𝑊 ∧ 𝑐 ∈ 𝑊 ∧ (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) = 𝑐)
87	77, 78, 85, 86	syl3anc 1373	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) = 𝑐)
88		fnfvelrn 7054	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑆 Fn dom 𝑆 ∧ (𝑜 ++ ⟨“𝑐”⟩) ∈ dom 𝑆) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) ∈ ran 𝑆)
89	69, 85, 88	sylancr 587	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → (𝑆‘(𝑜 ++ ⟨“𝑐”⟩)) ∈ ran 𝑆)
90	87, 89	eqeltrrd 2830	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ ((𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏)) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏))) → 𝑐 ∈ ran 𝑆)
91	90	anassrs 467	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) ∧ (𝑜 ∈ dom 𝑆 ∧ (𝑆‘𝑜) = 𝑏)) → 𝑐 ∈ ran 𝑆)
92	72, 91	rexlimddv 3141	. . . . . . . . . . . . . . 15 ⊢ ((((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) ∧ (𝑏 ∈ 𝑊 ∧ 𝑐 ∈ ran (𝑇‘𝑏))) → 𝑐 ∈ ran 𝑆)
93	92	rexlimdvaa 3136	. . . . . . . . . . . . . 14 ⊢ (((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (∃𝑏 ∈ 𝑊 𝑐 ∈ ran (𝑇‘𝑏) → 𝑐 ∈ ran 𝑆))
94	49, 93	biimtrid 242	. . . . . . . . . . . . 13 ⊢ (((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
95		eldif 3926	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) ↔ (𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)))
96	5	eleq2i 2821	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ∈ 𝐷 ↔ 𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)))
97	1, 2, 3, 4, 5, 6	efgs1 19671	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ∈ 𝐷 → ⟨“𝑐”⟩ ∈ dom 𝑆)
98	96, 97	sylbir 235	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ (𝑊 ∖ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → ⟨“𝑐”⟩ ∈ dom 𝑆)
99	95, 98	sylbir 235	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → ⟨“𝑐”⟩ ∈ dom 𝑆)
100	1, 2, 3, 4, 5, 6	efgsval 19667	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨“𝑐”⟩ ∈ dom 𝑆 → (𝑆‘⟨“𝑐”⟩) = (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)))
101	99, 100	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) = (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)))
102		s1len 14577	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (♯‘⟨“𝑐”⟩) = 1
103	102	oveq1i 7399	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘⟨“𝑐”⟩) − 1) = (1 − 1)
104		1m1e0 12259	. . . . . . . . . . . . . . . . . . . 20 ⊢ (1 − 1) = 0
105	103, 104	eqtri 2753	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘⟨“𝑐”⟩) − 1) = 0
106	105	fveq2i 6863	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)) = (⟨“𝑐”⟩‘0)
107	106	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (⟨“𝑐”⟩‘((♯‘⟨“𝑐”⟩) − 1)) = (⟨“𝑐”⟩‘0))
108		s1fv 14581	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑐 ∈ 𝑊 → (⟨“𝑐”⟩‘0) = 𝑐)
109	108	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (⟨“𝑐”⟩‘0) = 𝑐)
110	101, 107, 109	3eqtrd 2769	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) = 𝑐)
111		fnfvelrn 7054	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑆 Fn dom 𝑆 ∧ ⟨“𝑐”⟩ ∈ dom 𝑆) → (𝑆‘⟨“𝑐”⟩) ∈ ran 𝑆)
112	69, 99, 111	sylancr 587	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → (𝑆‘⟨“𝑐”⟩) ∈ ran 𝑆)
113	110, 112	eqeltrrd 2830	. . . . . . . . . . . . . . 15 ⊢ ((𝑐 ∈ 𝑊 ∧ ¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥)) → 𝑐 ∈ ran 𝑆)
114	113	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ 𝑊 → (¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
115	114	3ad2ant2 1134	. . . . . . . . . . . . 13 ⊢ (((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → (¬ 𝑐 ∈ ∪ 𝑥 ∈ 𝑊 ran (𝑇‘𝑥) → 𝑐 ∈ ran 𝑆))
116	94, 115	pm2.61d 179	. . . . . . . . . . . 12 ⊢ (((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) ∧ 𝑐 ∈ 𝑊 ∧ (♯‘𝑐) = 𝑑) → 𝑐 ∈ ran 𝑆)
117	116	rabssdv 4040	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑐 ∈ 𝑊 ∣ (♯‘𝑐) = 𝑑} ⊆ ran 𝑆)
118	43, 117	eqsstrid 3987	. . . . . . . . . 10 ⊢ ((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑} ⊆ ran 𝑆)
119	41, 118	unssd 4157	. . . . . . . . 9 ⊢ ((𝑑 ∈ ℕ0 ∧ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆) → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆)
120	119	ex 412	. . . . . . . 8 ⊢ (𝑑 ∈ ℕ0 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆))
121		id 22	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ0 → 𝑑 ∈ ℕ0)
122		nn0leltp1 12599	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑎) ∈ ℕ0 ∧ 𝑑 ∈ ℕ0) → ((♯‘𝑎) ≤ 𝑑 ↔ (♯‘𝑎) < (𝑑 + 1)))
123	21, 121, 122	syl2anr 597	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ ℕ0 ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) ≤ 𝑑 ↔ (♯‘𝑎) < (𝑑 + 1)))
124	21	nn0red 12510	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑊 → (♯‘𝑎) ∈ ℝ)
125		nn0re 12457	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ ℕ0 → 𝑑 ∈ ℝ)
126		leloe 11266	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑎) ∈ ℝ ∧ 𝑑 ∈ ℝ) → ((♯‘𝑎) ≤ 𝑑 ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
127	124, 125, 126	syl2anr 597	. . . . . . . . . . . 12 ⊢ ((𝑑 ∈ ℕ0 ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) ≤ 𝑑 ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
128	123, 127	bitr3d 281	. . . . . . . . . . 11 ⊢ ((𝑑 ∈ ℕ0 ∧ 𝑎 ∈ 𝑊) → ((♯‘𝑎) < (𝑑 + 1) ↔ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)))
129	128	rabbidva 3415	. . . . . . . . . 10 ⊢ (𝑑 ∈ ℕ0 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} = {𝑎 ∈ 𝑊 ∣ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)})
130		unrab 4280	. . . . . . . . . 10 ⊢ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) = {𝑎 ∈ 𝑊 ∣ ((♯‘𝑎) < 𝑑 ∨ (♯‘𝑎) = 𝑑)}
131	129, 130	eqtr4di 2783	. . . . . . . . 9 ⊢ (𝑑 ∈ ℕ0 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} = ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}))
132	131	sseq1d 3980	. . . . . . . 8 ⊢ (𝑑 ∈ ℕ0 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆 ↔ ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ∪ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) = 𝑑}) ⊆ ran 𝑆))
133	120, 132	sylibrd 259	. . . . . . 7 ⊢ (𝑑 ∈ ℕ0 → ({𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < 𝑑} ⊆ ran 𝑆 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < (𝑑 + 1)} ⊆ ran 𝑆))
134	30, 33, 36, 39, 40, 133	nn0ind 12635	. . . . . 6 ⊢ (((♯‘𝑐) + 1) ∈ ℕ0 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆)
135	17, 18, 134	3syl 18	. . . . 5 ⊢ (𝑐 ∈ 𝑊 → {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)} ⊆ ran 𝑆)
136		fveq2 6860	. . . . . . 7 ⊢ (𝑎 = 𝑐 → (♯‘𝑎) = (♯‘𝑐))
137	136	breq1d 5119	. . . . . 6 ⊢ (𝑎 = 𝑐 → ((♯‘𝑎) < ((♯‘𝑐) + 1) ↔ (♯‘𝑐) < ((♯‘𝑐) + 1)))
138		id 22	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ 𝑊)
139	17	nn0red 12510	. . . . . . 7 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) ∈ ℝ)
140	139	ltp1d 12119	. . . . . 6 ⊢ (𝑐 ∈ 𝑊 → (♯‘𝑐) < ((♯‘𝑐) + 1))
141	137, 138, 140	elrabd 3663	. . . . 5 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ {𝑎 ∈ 𝑊 ∣ (♯‘𝑎) < ((♯‘𝑐) + 1)})
142	135, 141	sseldd 3949	. . . 4 ⊢ (𝑐 ∈ 𝑊 → 𝑐 ∈ ran 𝑆)
143	142	ssriv 3952	. . 3 ⊢ 𝑊 ⊆ ran 𝑆
144	12, 143	eqssi 3965	. 2 ⊢ ran 𝑆 = 𝑊
145		dffo2 6778	. 2 ⊢ (𝑆:dom 𝑆–onto→𝑊 ↔ (𝑆:dom 𝑆⟶𝑊 ∧ ran 𝑆 = 𝑊))
146	10, 144, 145	mpbir2an 711	1 ⊢ 𝑆:dom 𝑆–onto→𝑊

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054  {crab 3408   ∖ cdif 3913   ∪ cun 3914   ⊆ wss 3916  ∅c0 4298  {csn 4591  ⟨cop 4597  ⟨cotp 4599  ∪ ciun 4957   class class class wbr 5109   ↦ cmpt 5190   I cid 5534   × cxp 5638  dom cdm 5640  ran crn 5641   Fn wfn 6508  ⟶wf 6509  –onto→wfo 6511  ‘cfv 6513  (class class class)co 7389   ∈ cmpo 7391  1_oc1o 8429  2_oc2o 8430  ℝcr 11073  0cc0 11074  1c1 11075   + caddc 11077   < clt 11214   ≤ cle 11215   − cmin 11411  2c2 12242  ℕ₀cn0 12448  ℝ⁺crp 12957  ...cfz 13474  ..^cfzo 13621  ♯chash 14301  Word cword 14484   ++ cconcat 14541  ⟨“cs1 14566   splice csplice 14720  ⟨“cs2 14813   ~_FG cefg 19642

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pow 5322  ax-pr 5389  ax-un 7713  ax-cnex 11130  ax-resscn 11131  ax-1cn 11132  ax-icn 11133  ax-addcl 11134  ax-addrcl 11135  ax-mulcl 11136  ax-mulrcl 11137  ax-mulcom 11138  ax-addass 11139  ax-mulass 11140  ax-distr 11141  ax-i2m1 11142  ax-1ne0 11143  ax-1rid 11144  ax-rnegex 11145  ax-rrecex 11146  ax-cnre 11147  ax-pre-lttri 11148  ax-pre-lttrn 11149  ax-pre-ltadd 11150  ax-pre-mulgt0 11151

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4874  df-int 4913  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6276  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-riota 7346  df-ov 7392  df-oprab 7393  df-mpo 7394  df-om 7845  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8380  df-1o 8436  df-2o 8437  df-er 8673  df-map 8803  df-en 8921  df-dom 8922  df-sdom 8923  df-fin 8924  df-card 9898  df-pnf 11216  df-mnf 11217  df-xr 11218  df-ltxr 11219  df-le 11220  df-sub 11413  df-neg 11414  df-nn 12188  df-2 12250  df-n0 12449  df-xnn0 12522  df-z 12536  df-uz 12800  df-rp 12958  df-fz 13475  df-fzo 13622  df-hash 14302  df-word 14485  df-concat 14542  df-s1 14567  df-substr 14612  df-pfx 14642  df-splice 14721  df-s2 14820

This theorem is referenced by:  efgredlemc  19681  efgrelexlemb  19686  efgredeu  19688  efgred2  19689