Theorem ctssdccl 6996

Description: A mapping from a decidable subset of the natural numbers onto a countable set. This is similar to one direction of ctssdc 6998 but expressed in terms of classes rather than ∃. (Contributed by Jim Kingdon, 30-Oct-2023.)

Hypotheses

Ref	Expression
ctssdccl.f	⊢ (𝜑 → 𝐹:ω–onto→(𝐴 ⊔ 1o))
ctssdccl.s	⊢ 𝑆 = {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)}
ctssdccl.g	⊢ 𝐺 = (◡inl ∘ 𝐹)

Assertion

Ref	Expression
ctssdccl	⊢ (𝜑 → (𝑆 ⊆ ω ∧ 𝐺:𝑆–onto→𝐴 ∧ ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆))

Distinct variable groups:   𝑥,𝐴   𝑛,𝐹,𝑥   𝑛,𝐺   𝑆,𝑛   𝜑,𝑛

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑛)   𝑆(𝑥)   𝐺(𝑥)

Proof of Theorem ctssdccl

Dummy variables 𝑚 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ctssdccl.s	. . . 4 ⊢ 𝑆 = {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)}
2		ssrab2 3182	. . . 4 ⊢ {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)} ⊆ ω
3	1, 2	eqsstri 3129	. . 3 ⊢ 𝑆 ⊆ ω
4	3	a1i 9	. 2 ⊢ (𝜑 → 𝑆 ⊆ ω)
5		djulf1o 6943	. . . . . . 7 ⊢ inl:V–1-1-onto→({∅} × V)
6		f1ocnv 5380	. . . . . . 7 ⊢ (inl:V–1-1-onto→({∅} × V) → ◡inl:({∅} × V)–1-1-onto→V)
7		f1ofun 5369	. . . . . . 7 ⊢ (◡inl:({∅} × V)–1-1-onto→V → Fun ◡inl)
8	5, 6, 7	mp2b 8	. . . . . 6 ⊢ Fun ◡inl
9		ctssdccl.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:ω–onto→(𝐴 ⊔ 1o))
10		fofun 5346	. . . . . . 7 ⊢ (𝐹:ω–onto→(𝐴 ⊔ 1o) → Fun 𝐹)
11	9, 10	syl 14	. . . . . 6 ⊢ (𝜑 → Fun 𝐹)
12		funco 5163	. . . . . . 7 ⊢ ((Fun ◡inl ∧ Fun 𝐹) → Fun (◡inl ∘ 𝐹))
13		ctssdccl.g	. . . . . . . 8 ⊢ 𝐺 = (◡inl ∘ 𝐹)
14	13	funeqi 5144	. . . . . . 7 ⊢ (Fun 𝐺 ↔ Fun (◡inl ∘ 𝐹))
15	12, 14	sylibr 133	. . . . . 6 ⊢ ((Fun ◡inl ∧ Fun 𝐹) → Fun 𝐺)
16	8, 11, 15	sylancr 410	. . . . 5 ⊢ (𝜑 → Fun 𝐺)
17		fof 5345	. . . . . . . . . . . 12 ⊢ (𝐹:ω–onto→(𝐴 ⊔ 1o) → 𝐹:ω⟶(𝐴 ⊔ 1o))
18	9, 17	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:ω⟶(𝐴 ⊔ 1o))
19	18	fdmd 5279	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = ω)
20	19	eleq2d 2209	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ dom 𝐹 ↔ 𝑛 ∈ ω))
21	20	anbi1d 460	. . . . . . . 8 ⊢ (𝜑 → ((𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
22		dmcoss 4808	. . . . . . . . . . . 12 ⊢ dom (◡inl ∘ 𝐹) ⊆ dom 𝐹
23	22	sseli 3093	. . . . . . . . . . 11 ⊢ (𝑛 ∈ dom (◡inl ∘ 𝐹) → 𝑛 ∈ dom 𝐹)
24	23	pm4.71ri 389	. . . . . . . . . 10 ⊢ (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ 𝑛 ∈ dom (◡inl ∘ 𝐹)))
25		dmfco 5489	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑛 ∈ dom 𝐹) → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
26	25	pm5.32da 447	. . . . . . . . . 10 ⊢ (Fun 𝐹 → ((𝑛 ∈ dom 𝐹 ∧ 𝑛 ∈ dom (◡inl ∘ 𝐹)) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
27	24, 26	syl5bb 191	. . . . . . . . 9 ⊢ (Fun 𝐹 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
28	11, 27	syl 14	. . . . . . . 8 ⊢ (𝜑 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
29		simpr 109	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ (inl “ 𝐴))
30		imassrn 4892	. . . . . . . . . . . . . 14 ⊢ (inl “ 𝐴) ⊆ ran inl
31	30	sseli 3093	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inl “ 𝐴) → (𝐹‘𝑛) ∈ ran inl)
32	31	adantl 275	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ ran inl)
33		df-rn 4550	. . . . . . . . . . . . 13 ⊢ ran inl = dom ◡inl
34	33	eleq2i 2206	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ ran inl ↔ (𝐹‘𝑛) ∈ dom ◡inl)
35	32, 34	sylib 121	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ dom ◡inl)
36	29, 35	2thd 174	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
37		djuin 6949	. . . . . . . . . . . . . 14 ⊢ ((inl “ 𝐴) ∩ (inr “ 1o)) = ∅
38		disjel 3417	. . . . . . . . . . . . . 14 ⊢ ((((inl “ 𝐴) ∩ (inr “ 1o)) = ∅ ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
39	37, 38	mpan 420	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inl “ 𝐴) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
40	39	con2i 616	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ (inr “ 1o) → ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴))
41	40	adantl 275	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴))
42		djuin 6949	. . . . . . . . . . . . . . . 16 ⊢ ((inl “ V) ∩ (inr “ 1o)) = ∅
43		disjel 3417	. . . . . . . . . . . . . . . 16 ⊢ ((((inl “ V) ∩ (inr “ 1o)) = ∅ ∧ (𝐹‘𝑛) ∈ (inl “ V)) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
44	42, 43	mpan 420	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑛) ∈ (inl “ V) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
45		dfrn4 4999	. . . . . . . . . . . . . . 15 ⊢ ran inl = (inl “ V)
46	44, 45	eleq2s 2234	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑛) ∈ ran inl → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
47	46	con2i 616	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inr “ 1o) → ¬ (𝐹‘𝑛) ∈ ran inl)
48	47	adantl 275	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ ran inl)
49	48, 34	sylnib 665	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ dom ◡inl)
50	41, 49	2falsed 691	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
51	18	ffvelrnda 5555	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (𝐹‘𝑛) ∈ (𝐴 ⊔ 1o))
52		djuun 6952	. . . . . . . . . . . . 13 ⊢ ((inl “ 𝐴) ∪ (inr “ 1o)) = (𝐴 ⊔ 1o)
53	52	eleq2i 2206	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)) ↔ (𝐹‘𝑛) ∈ (𝐴 ⊔ 1o))
54	51, 53	sylibr 133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)))
55		elun 3217	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
56	54, 55	sylib 121	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
57	36, 50, 56	mpjaodan 787	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
58	57	pm5.32da 447	. . . . . . . 8 ⊢ (𝜑 → ((𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
59	21, 28, 58	3bitr4d 219	. . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
60	13	dmeqi 4740	. . . . . . . 8 ⊢ dom 𝐺 = dom (◡inl ∘ 𝐹)
61	60	eleq2i 2206	. . . . . . 7 ⊢ (𝑛 ∈ dom 𝐺 ↔ 𝑛 ∈ dom (◡inl ∘ 𝐹))
62		fveq2 5421	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝐹‘𝑥) = (𝐹‘𝑛))
63	62	eleq1d 2208	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
64	63, 1	elrab2 2843	. . . . . . 7 ⊢ (𝑛 ∈ 𝑆 ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
65	59, 61, 64	3bitr4g 222	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ dom 𝐺 ↔ 𝑛 ∈ 𝑆))
66	65	eqrdv 2137	. . . . 5 ⊢ (𝜑 → dom 𝐺 = 𝑆)
67		df-fn 5126	. . . . 5 ⊢ (𝐺 Fn 𝑆 ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝑆))
68	16, 66, 67	sylanbrc 413	. . . 4 ⊢ (𝜑 → 𝐺 Fn 𝑆)
69	13	fveq1i 5422	. . . . . . 7 ⊢ (𝐺‘𝑚) = ((◡inl ∘ 𝐹)‘𝑚)
70	18	adantr 274	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → 𝐹:ω⟶(𝐴 ⊔ 1o))
71		fveq2 5421	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑚 → (𝐹‘𝑥) = (𝐹‘𝑚))
72	71	eleq1d 2208	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑚 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
73	72, 1	elrab2 2843	. . . . . . . . . . 11 ⊢ (𝑚 ∈ 𝑆 ↔ (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
74	73	biimpi 119	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝑆 → (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
75	74	adantl 275	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
76	75	simpld 111	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → 𝑚 ∈ ω)
77		fvco3 5492	. . . . . . . 8 ⊢ ((𝐹:ω⟶(𝐴 ⊔ 1o) ∧ 𝑚 ∈ ω) → ((◡inl ∘ 𝐹)‘𝑚) = (◡inl‘(𝐹‘𝑚)))
78	70, 76, 77	syl2anc 408	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → ((◡inl ∘ 𝐹)‘𝑚) = (◡inl‘(𝐹‘𝑚)))
79	69, 78	syl5eq 2184	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝐺‘𝑚) = (◡inl‘(𝐹‘𝑚)))
80		f1ofun 5369	. . . . . . . . . 10 ⊢ (inl:V–1-1-onto→({∅} × V) → Fun inl)
81	5, 80	ax-mp 5	. . . . . . . . 9 ⊢ Fun inl
82		fvelima 5473	. . . . . . . . 9 ⊢ ((Fun inl ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
83	81, 82	mpan 420	. . . . . . . 8 ⊢ ((𝐹‘𝑚) ∈ (inl “ 𝐴) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
84	75, 83	simpl2im 383	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
85		simprr 521	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (inl‘𝑧) = (𝐹‘𝑚))
86	85	fveq2d 5425	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(inl‘𝑧)) = (◡inl‘(𝐹‘𝑚)))
87		vex 2689	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
88		f1ocnvfv1 5678	. . . . . . . . . 10 ⊢ ((inl:V–1-1-onto→({∅} × V) ∧ 𝑧 ∈ V) → (◡inl‘(inl‘𝑧)) = 𝑧)
89	5, 87, 88	mp2an 422	. . . . . . . . 9 ⊢ (◡inl‘(inl‘𝑧)) = 𝑧
90		simprl 520	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → 𝑧 ∈ 𝐴)
91	89, 90	eqeltrid 2226	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(inl‘𝑧)) ∈ 𝐴)
92	86, 91	eqeltrrd 2217	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(𝐹‘𝑚)) ∈ 𝐴)
93	84, 92	rexlimddv 2554	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (◡inl‘(𝐹‘𝑚)) ∈ 𝐴)
94	79, 93	eqeltrd 2216	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝐺‘𝑚) ∈ 𝐴)
95	94	ralrimiva 2505	. . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝑆 (𝐺‘𝑚) ∈ 𝐴)
96		ffnfv 5578	. . . 4 ⊢ (𝐺:𝑆⟶𝐴 ↔ (𝐺 Fn 𝑆 ∧ ∀𝑚 ∈ 𝑆 (𝐺‘𝑚) ∈ 𝐴))
97	68, 95, 96	sylanbrc 413	. . 3 ⊢ (𝜑 → 𝐺:𝑆⟶𝐴)
98		djulcl 6936	. . . . . . . 8 ⊢ (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (𝐴 ⊔ 1o))
99		foelrn 5654	. . . . . . . . . 10 ⊢ ((𝐹:ω–onto→(𝐴 ⊔ 1o) ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦))
100	9, 99	sylan 281	. . . . . . . . 9 ⊢ ((𝜑 ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦))
101		df-rex 2422	. . . . . . . . 9 ⊢ (∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦) ↔ ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
102	100, 101	sylib 121	. . . . . . . 8 ⊢ ((𝜑 ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
103	98, 102	sylan2 284	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
104		fveq2 5421	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
105	104	eleq1d 2208	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑦) ∈ (inl “ 𝐴)))
106		simprl 520	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ ω)
107		simprr 521	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (inl‘𝑚) = (𝐹‘𝑦))
108		vex 2689	. . . . . . . . . . . . . . . 16 ⊢ 𝑚 ∈ V
109		f1odm 5371	. . . . . . . . . . . . . . . . 17 ⊢ (inl:V–1-1-onto→({∅} × V) → dom inl = V)
110	5, 109	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ dom inl = V
111	108, 110	eleqtrri 2215	. . . . . . . . . . . . . . 15 ⊢ 𝑚 ∈ dom inl
112		funfvima 5649	. . . . . . . . . . . . . . 15 ⊢ ((Fun inl ∧ 𝑚 ∈ dom inl) → (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (inl “ 𝐴)))
113	81, 111, 112	mp2an 422	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (inl “ 𝐴))
114	113	ad2antlr 480	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (inl‘𝑚) ∈ (inl “ 𝐴))
115	107, 114	eqeltrrd 2217	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (𝐹‘𝑦) ∈ (inl “ 𝐴))
116	105, 106, 115	elrabd 2842	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)})
117	116, 1	eleqtrrdi 2233	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ 𝑆)
118	117, 107	jca 304	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
119	118	ex 114	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ((𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦))))
120	119	eximdv 1852	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)) → ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦))))
121	103, 120	mpd 13	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
122		df-rex 2422	. . . . . 6 ⊢ (∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦) ↔ ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
123	121, 122	sylibr 133	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦))
124		f1ocnvfv1 5678	. . . . . . . . . 10 ⊢ ((inl:V–1-1-onto→({∅} × V) ∧ 𝑚 ∈ V) → (◡inl‘(inl‘𝑚)) = 𝑚)
125	5, 108, 124	mp2an 422	. . . . . . . . 9 ⊢ (◡inl‘(inl‘𝑚)) = 𝑚
126		simpr 109	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (inl‘𝑚) = (𝐹‘𝑦))
127	126	fveq2d 5425	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (◡inl‘(inl‘𝑚)) = (◡inl‘(𝐹‘𝑦)))
128	125, 127	syl5eqr 2186	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → 𝑚 = (◡inl‘(𝐹‘𝑦)))
129	13	fveq1i 5422	. . . . . . . . . 10 ⊢ (𝐺‘𝑦) = ((◡inl ∘ 𝐹)‘𝑦)
130	18	ad2antrr 479	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → 𝐹:ω⟶(𝐴 ⊔ 1o))
131	3	sseli 3093	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ω)
132	131	adantl 275	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ω)
133		fvco3 5492	. . . . . . . . . . 11 ⊢ ((𝐹:ω⟶(𝐴 ⊔ 1o) ∧ 𝑦 ∈ ω) → ((◡inl ∘ 𝐹)‘𝑦) = (◡inl‘(𝐹‘𝑦)))
134	130, 132, 133	syl2anc 408	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → ((◡inl ∘ 𝐹)‘𝑦) = (◡inl‘(𝐹‘𝑦)))
135	129, 134	syl5eq 2184	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → (𝐺‘𝑦) = (◡inl‘(𝐹‘𝑦)))
136	135	adantr 274	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (𝐺‘𝑦) = (◡inl‘(𝐹‘𝑦)))
137	128, 136	eqtr4d 2175	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → 𝑚 = (𝐺‘𝑦))
138	137	ex 114	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → ((inl‘𝑚) = (𝐹‘𝑦) → 𝑚 = (𝐺‘𝑦)))
139	138	reximdva 2534	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦) → ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦)))
140	123, 139	mpd 13	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦))
141	140	ralrimiva 2505	. . 3 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦))
142		dffo3 5567	. . 3 ⊢ (𝐺:𝑆–onto→𝐴 ↔ (𝐺:𝑆⟶𝐴 ∧ ∀𝑚 ∈ 𝐴 ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦)))
143	97, 141, 142	sylanbrc 413	. 2 ⊢ (𝜑 → 𝐺:𝑆–onto→𝐴)
144	53, 55	bitr3i 185	. . . . . . 7 ⊢ ((𝐹‘𝑛) ∈ (𝐴 ⊔ 1o) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
145	51, 144	sylib 121	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
146	40	orim2i 750	. . . . . 6 ⊢ (((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
147	145, 146	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
148		df-dc 820	. . . . 5 ⊢ (DECID (𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
149	147, 148	sylibr 133	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → DECID (𝐹‘𝑛) ∈ (inl “ 𝐴))
150		ibar 299	. . . . . . 7 ⊢ (𝑛 ∈ ω → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
151	150	adantl 275	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
152	151, 64	syl6bbr 197	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ 𝑛 ∈ 𝑆))
153	152	dcbid 823	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (DECID (𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ DECID 𝑛 ∈ 𝑆))
154	149, 153	mpbid 146	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → DECID 𝑛 ∈ 𝑆)
155	154	ralrimiva 2505	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
156	4, 143, 155	3jca 1161	1 ⊢ (𝜑 → (𝑆 ⊆ ω ∧ 𝐺:𝑆–onto→𝐴 ∧ ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697  DECID wdc 819   ∧ w3a 962   = wceq 1331  ∃wex 1468   ∈ wcel 1480  ∀wral 2416  ∃wrex 2417  {crab 2420  Vcvv 2686   ∪ cun 3069   ∩ cin 3070   ⊆ wss 3071  ∅c0 3363  {csn 3527  ωcom 4504   × cxp 4537  ^◡ccnv 4538  dom cdm 4539  ran crn 4540   “ cima 4542   ∘ ccom 4543  Fun wfun 5117   Fn wfn 5118  ⟶wf 5119  –onto→wfo 5121  –1-1-onto→wf1o 5122  ‘cfv 5123  1_oc1o 6306   ⊔ cdju 6922  inlcinl 6930  inrcinr 6931

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-1st 6038  df-2nd 6039  df-1o 6313  df-dju 6923  df-inl 6932  df-inr 6933

This theorem is referenced by:  ctssdclemr  6997  ctiunct  11953