Theorem ctssdccl 7445

Description: A mapping from a decidable subset of the natural numbers onto a countable set. This is similar to one direction of ctssdc 7447 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 3333	. . . 4 ⊢ {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)} ⊆ ω
3	1, 2	eqsstri 3280	. . 3 ⊢ 𝑆 ⊆ ω
4	3	a1i 9	. 2 ⊢ (𝜑 → 𝑆 ⊆ ω)
5		djulf1o 7392	. . . . . . 7 ⊢ inl:V–1-1-onto→({∅} × V)
6		f1ocnv 5650	. . . . . . 7 ⊢ (inl:V–1-1-onto→({∅} × V) → ◡inl:({∅} × V)–1-1-onto→V)
7		f1ofun 5639	. . . . . . 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 5614	. . . . . . 7 ⊢ (𝐹:ω–onto→(𝐴 ⊔ 1o) → Fun 𝐹)
11	9, 10	syl 14	. . . . . 6 ⊢ (𝜑 → Fun 𝐹)
12		funco 5415	. . . . . . 7 ⊢ ((Fun ◡inl ∧ Fun 𝐹) → Fun (◡inl ∘ 𝐹))
13		ctssdccl.g	. . . . . . . 8 ⊢ 𝐺 = (◡inl ∘ 𝐹)
14	13	funeqi 5396	. . . . . . 7 ⊢ (Fun 𝐺 ↔ Fun (◡inl ∘ 𝐹))
15	12, 14	sylibr 134	. . . . . 6 ⊢ ((Fun ◡inl ∧ Fun 𝐹) → Fun 𝐺)
16	8, 11, 15	sylancr 418	. . . . 5 ⊢ (𝜑 → Fun 𝐺)
17		fof 5613	. . . . . . . . . . . 12 ⊢ (𝐹:ω–onto→(𝐴 ⊔ 1o) → 𝐹:ω⟶(𝐴 ⊔ 1o))
18	9, 17	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:ω⟶(𝐴 ⊔ 1o))
19	18	fdmd 5538	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = ω)
20	19	eleq2d 2308	. . . . . . . . 9 ⊢ (𝜑 → (𝑛 ∈ dom 𝐹 ↔ 𝑛 ∈ ω))
21	20	anbi1d 469	. . . . . . . 8 ⊢ (𝜑 → ((𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
22		dmcoss 5050	. . . . . . . . . . . 12 ⊢ dom (◡inl ∘ 𝐹) ⊆ dom 𝐹
23	22	sseli 3244	. . . . . . . . . . 11 ⊢ (𝑛 ∈ dom (◡inl ∘ 𝐹) → 𝑛 ∈ dom 𝐹)
24	23	pm4.71ri 396	. . . . . . . . . 10 ⊢ (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ 𝑛 ∈ dom (◡inl ∘ 𝐹)))
25		dmfco 5770	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑛 ∈ dom 𝐹) → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
26	25	pm5.32da 456	. . . . . . . . . 10 ⊢ (Fun 𝐹 → ((𝑛 ∈ dom 𝐹 ∧ 𝑛 ∈ dom (◡inl ∘ 𝐹)) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
27	24, 26	bitrid 192	. . . . . . . . 9 ⊢ (Fun 𝐹 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
28	11, 27	syl 14	. . . . . . . 8 ⊢ (𝜑 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ dom 𝐹 ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
29		simpr 110	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ (inl “ 𝐴))
30		imassrn 5135	. . . . . . . . . . . . . 14 ⊢ (inl “ 𝐴) ⊆ ran inl
31	30	sseli 3244	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inl “ 𝐴) → (𝐹‘𝑛) ∈ ran inl)
32	31	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ ran inl)
33		df-rn 4783	. . . . . . . . . . . . 13 ⊢ ran inl = dom ◡inl
34	33	eleq2i 2305	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ ran inl ↔ (𝐹‘𝑛) ∈ dom ◡inl)
35	32, 34	sylib 122	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → (𝐹‘𝑛) ∈ dom ◡inl)
36	29, 35	2thd 175	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
37		djuin 7398	. . . . . . . . . . . . . 14 ⊢ ((inl “ 𝐴) ∩ (inr “ 1o)) = ∅
38		disjel 3579	. . . . . . . . . . . . . 14 ⊢ ((((inl “ 𝐴) ∩ (inr “ 1o)) = ∅ ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
39	37, 38	mpan 428	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inl “ 𝐴) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
40	39	con2i 636	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ (inr “ 1o) → ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴))
41	40	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴))
42		djuin 7398	. . . . . . . . . . . . . . . 16 ⊢ ((inl “ V) ∩ (inr “ 1o)) = ∅
43		disjel 3579	. . . . . . . . . . . . . . . 16 ⊢ ((((inl “ V) ∩ (inr “ 1o)) = ∅ ∧ (𝐹‘𝑛) ∈ (inl “ V)) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
44	42, 43	mpan 428	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑛) ∈ (inl “ V) → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
45		dfrn4 5246	. . . . . . . . . . . . . . 15 ⊢ ran inl = (inl “ V)
46	44, 45	eleq2s 2333	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑛) ∈ ran inl → ¬ (𝐹‘𝑛) ∈ (inr “ 1o))
47	46	con2i 636	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑛) ∈ (inr “ 1o) → ¬ (𝐹‘𝑛) ∈ ran inl)
48	47	adantl 277	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ ran inl)
49	48, 34	sylnib 687	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ¬ (𝐹‘𝑛) ∈ dom ◡inl)
50	41, 49	2falsed 714	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ω) ∧ (𝐹‘𝑛) ∈ (inr “ 1o)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
51	18	ffvelcdmda 5837	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (𝐹‘𝑛) ∈ (𝐴 ⊔ 1o))
52		djuun 7401	. . . . . . . . . . . . 13 ⊢ ((inl “ 𝐴) ∪ (inr “ 1o)) = (𝐴 ⊔ 1o)
53	52	eleq2i 2305	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)) ↔ (𝐹‘𝑛) ∈ (𝐴 ⊔ 1o))
54	51, 53	sylibr 134	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)))
55		elun 3370	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑛) ∈ ((inl “ 𝐴) ∪ (inr “ 1o)) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
56	54, 55	sylib 122	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
57	36, 50, 56	mpjaodan 810	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ dom ◡inl))
58	57	pm5.32da 456	. . . . . . . 8 ⊢ (𝜑 → ((𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ dom ◡inl)))
59	21, 28, 58	3bitr4d 220	. . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ dom (◡inl ∘ 𝐹) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
60	13	dmeqi 4980	. . . . . . . 8 ⊢ dom 𝐺 = dom (◡inl ∘ 𝐹)
61	60	eleq2i 2305	. . . . . . 7 ⊢ (𝑛 ∈ dom 𝐺 ↔ 𝑛 ∈ dom (◡inl ∘ 𝐹))
62		fveq2 5693	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝐹‘𝑥) = (𝐹‘𝑛))
63	62	eleq1d 2307	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
64	63, 1	elrab2 2985	. . . . . . 7 ⊢ (𝑛 ∈ 𝑆 ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
65	59, 61, 64	3bitr4g 223	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ dom 𝐺 ↔ 𝑛 ∈ 𝑆))
66	65	eqrdv 2236	. . . . 5 ⊢ (𝜑 → dom 𝐺 = 𝑆)
67		df-fn 5378	. . . . 5 ⊢ (𝐺 Fn 𝑆 ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝑆))
68	16, 66, 67	sylanbrc 421	. . . 4 ⊢ (𝜑 → 𝐺 Fn 𝑆)
69	13	fveq1i 5694	. . . . . . 7 ⊢ (𝐺‘𝑚) = ((◡inl ∘ 𝐹)‘𝑚)
70	18	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → 𝐹:ω⟶(𝐴 ⊔ 1o))
71		fveq2 5693	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑚 → (𝐹‘𝑥) = (𝐹‘𝑚))
72	71	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑚 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
73	72, 1	elrab2 2985	. . . . . . . . . . 11 ⊢ (𝑚 ∈ 𝑆 ↔ (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
74	73	biimpi 120	. . . . . . . . . 10 ⊢ (𝑚 ∈ 𝑆 → (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
75	74	adantl 277	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝑚 ∈ ω ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)))
76	75	simpld 112	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → 𝑚 ∈ ω)
77		fvco3 5773	. . . . . . . 8 ⊢ ((𝐹:ω⟶(𝐴 ⊔ 1o) ∧ 𝑚 ∈ ω) → ((◡inl ∘ 𝐹)‘𝑚) = (◡inl‘(𝐹‘𝑚)))
78	70, 76, 77	syl2anc 415	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → ((◡inl ∘ 𝐹)‘𝑚) = (◡inl‘(𝐹‘𝑚)))
79	69, 78	eqtrid 2283	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝐺‘𝑚) = (◡inl‘(𝐹‘𝑚)))
80		f1ofun 5639	. . . . . . . . . 10 ⊢ (inl:V–1-1-onto→({∅} × V) → Fun inl)
81	5, 80	ax-mp 5	. . . . . . . . 9 ⊢ Fun inl
82		fvelima 5751	. . . . . . . . 9 ⊢ ((Fun inl ∧ (𝐹‘𝑚) ∈ (inl “ 𝐴)) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
83	81, 82	mpan 428	. . . . . . . 8 ⊢ ((𝐹‘𝑚) ∈ (inl “ 𝐴) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
84	75, 83	simpl2im 390	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → ∃𝑧 ∈ 𝐴 (inl‘𝑧) = (𝐹‘𝑚))
85		simprr 537	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (inl‘𝑧) = (𝐹‘𝑚))
86	85	fveq2d 5697	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(inl‘𝑧)) = (◡inl‘(𝐹‘𝑚)))
87		vex 2824	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
88		f1ocnvfv1 5977	. . . . . . . . . 10 ⊢ ((inl:V–1-1-onto→({∅} × V) ∧ 𝑧 ∈ V) → (◡inl‘(inl‘𝑧)) = 𝑧)
89	5, 87, 88	mp2an 430	. . . . . . . . 9 ⊢ (◡inl‘(inl‘𝑧)) = 𝑧
90		simprl 535	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → 𝑧 ∈ 𝐴)
91	89, 90	eqeltrid 2325	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(inl‘𝑧)) ∈ 𝐴)
92	86, 91	eqeltrrd 2316	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑆) ∧ (𝑧 ∈ 𝐴 ∧ (inl‘𝑧) = (𝐹‘𝑚))) → (◡inl‘(𝐹‘𝑚)) ∈ 𝐴)
93	84, 92	rexlimddv 2673	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (◡inl‘(𝐹‘𝑚)) ∈ 𝐴)
94	79, 93	eqeltrd 2315	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑆) → (𝐺‘𝑚) ∈ 𝐴)
95	94	ralrimiva 2623	. . . 4 ⊢ (𝜑 → ∀𝑚 ∈ 𝑆 (𝐺‘𝑚) ∈ 𝐴)
96		ffnfv 5860	. . . 4 ⊢ (𝐺:𝑆⟶𝐴 ↔ (𝐺 Fn 𝑆 ∧ ∀𝑚 ∈ 𝑆 (𝐺‘𝑚) ∈ 𝐴))
97	68, 95, 96	sylanbrc 421	. . 3 ⊢ (𝜑 → 𝐺:𝑆⟶𝐴)
98		djulcl 7385	. . . . . . . 8 ⊢ (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (𝐴 ⊔ 1o))
99		foelrn 5952	. . . . . . . . . 10 ⊢ ((𝐹:ω–onto→(𝐴 ⊔ 1o) ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦))
100	9, 99	sylan 283	. . . . . . . . 9 ⊢ ((𝜑 ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦))
101		df-rex 2534	. . . . . . . . 9 ⊢ (∃𝑦 ∈ ω (inl‘𝑚) = (𝐹‘𝑦) ↔ ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
102	100, 101	sylib 122	. . . . . . . 8 ⊢ ((𝜑 ∧ (inl‘𝑚) ∈ (𝐴 ⊔ 1o)) → ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
103	98, 102	sylan2 286	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)))
104		fveq2 5693	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦))
105	104	eleq1d 2307	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) ∈ (inl “ 𝐴) ↔ (𝐹‘𝑦) ∈ (inl “ 𝐴)))
106		simprl 535	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ ω)
107		simprr 537	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (inl‘𝑚) = (𝐹‘𝑦))
108		vex 2824	. . . . . . . . . . . . . . . 16 ⊢ 𝑚 ∈ V
109		f1odm 5641	. . . . . . . . . . . . . . . . 17 ⊢ (inl:V–1-1-onto→({∅} × V) → dom inl = V)
110	5, 109	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ dom inl = V
111	108, 110	eleqtrri 2314	. . . . . . . . . . . . . . 15 ⊢ 𝑚 ∈ dom inl
112		funfvima 5944	. . . . . . . . . . . . . . 15 ⊢ ((Fun inl ∧ 𝑚 ∈ dom inl) → (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (inl “ 𝐴)))
113	81, 111, 112	mp2an 430	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝐴 → (inl‘𝑚) ∈ (inl “ 𝐴))
114	113	ad2antlr 493	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (inl‘𝑚) ∈ (inl “ 𝐴))
115	107, 114	eqeltrrd 2316	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (𝐹‘𝑦) ∈ (inl “ 𝐴))
116	105, 106, 115	elrabd 2984	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ {𝑥 ∈ ω ∣ (𝐹‘𝑥) ∈ (inl “ 𝐴)})
117	116, 1	eleqtrrdi 2332	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → 𝑦 ∈ 𝑆)
118	117, 107	jca 306	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ (𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦))) → (𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
119	118	ex 115	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ((𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦))))
120	119	eximdv 1933	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (∃𝑦(𝑦 ∈ ω ∧ (inl‘𝑚) = (𝐹‘𝑦)) → ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦))))
121	103, 120	mpd 13	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
122		df-rex 2534	. . . . . 6 ⊢ (∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦) ↔ ∃𝑦(𝑦 ∈ 𝑆 ∧ (inl‘𝑚) = (𝐹‘𝑦)))
123	121, 122	sylibr 134	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦))
124		f1ocnvfv1 5977	. . . . . . . . . 10 ⊢ ((inl:V–1-1-onto→({∅} × V) ∧ 𝑚 ∈ V) → (◡inl‘(inl‘𝑚)) = 𝑚)
125	5, 108, 124	mp2an 430	. . . . . . . . 9 ⊢ (◡inl‘(inl‘𝑚)) = 𝑚
126		simpr 110	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (inl‘𝑚) = (𝐹‘𝑦))
127	126	fveq2d 5697	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (◡inl‘(inl‘𝑚)) = (◡inl‘(𝐹‘𝑦)))
128	125, 127	eqtr3id 2285	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → 𝑚 = (◡inl‘(𝐹‘𝑦)))
129	13	fveq1i 5694	. . . . . . . . . 10 ⊢ (𝐺‘𝑦) = ((◡inl ∘ 𝐹)‘𝑦)
130	18	ad2antrr 492	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → 𝐹:ω⟶(𝐴 ⊔ 1o))
131	3	sseli 3244	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑆 → 𝑦 ∈ ω)
132	131	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ ω)
133		fvco3 5773	. . . . . . . . . . 11 ⊢ ((𝐹:ω⟶(𝐴 ⊔ 1o) ∧ 𝑦 ∈ ω) → ((◡inl ∘ 𝐹)‘𝑦) = (◡inl‘(𝐹‘𝑦)))
134	130, 132, 133	syl2anc 415	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → ((◡inl ∘ 𝐹)‘𝑦) = (◡inl‘(𝐹‘𝑦)))
135	129, 134	eqtrid 2283	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → (𝐺‘𝑦) = (◡inl‘(𝐹‘𝑦)))
136	135	adantr 276	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → (𝐺‘𝑦) = (◡inl‘(𝐹‘𝑦)))
137	128, 136	eqtr4d 2274	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) ∧ (inl‘𝑚) = (𝐹‘𝑦)) → 𝑚 = (𝐺‘𝑦))
138	137	ex 115	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝐴) ∧ 𝑦 ∈ 𝑆) → ((inl‘𝑚) = (𝐹‘𝑦) → 𝑚 = (𝐺‘𝑦)))
139	138	reximdva 2652	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → (∃𝑦 ∈ 𝑆 (inl‘𝑚) = (𝐹‘𝑦) → ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦)))
140	123, 139	mpd 13	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝐴) → ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦))
141	140	ralrimiva 2623	. . 3 ⊢ (𝜑 → ∀𝑚 ∈ 𝐴 ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦))
142		dffo3 5849	. . 3 ⊢ (𝐺:𝑆–onto→𝐴 ↔ (𝐺:𝑆⟶𝐴 ∧ ∀𝑚 ∈ 𝐴 ∃𝑦 ∈ 𝑆 𝑚 = (𝐺‘𝑦)))
143	97, 141, 142	sylanbrc 421	. 2 ⊢ (𝜑 → 𝐺:𝑆–onto→𝐴)
144	53, 55	bitr3i 186	. . . . . . 7 ⊢ ((𝐹‘𝑛) ∈ (𝐴 ⊔ 1o) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
145	51, 144	sylib 122	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)))
146	40	orim2i 773	. . . . . 6 ⊢ (((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ (𝐹‘𝑛) ∈ (inr “ 1o)) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
147	145, 146	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
148		df-dc 847	. . . . 5 ⊢ (DECID (𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ ((𝐹‘𝑛) ∈ (inl “ 𝐴) ∨ ¬ (𝐹‘𝑛) ∈ (inl “ 𝐴)))
149	147, 148	sylibr 134	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → DECID (𝐹‘𝑛) ∈ (inl “ 𝐴))
150		ibar 301	. . . . . . 7 ⊢ (𝑛 ∈ ω → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
151	150	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ (𝑛 ∈ ω ∧ (𝐹‘𝑛) ∈ (inl “ 𝐴))))
152	151, 64	bitr4di 198	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → ((𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ 𝑛 ∈ 𝑆))
153	152	dcbid 850	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → (DECID (𝐹‘𝑛) ∈ (inl “ 𝐴) ↔ DECID 𝑛 ∈ 𝑆))
154	149, 153	mpbid 147	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ω) → DECID 𝑛 ∈ 𝑆)
155	154	ralrimiva 2623	. 2 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
156	4, 143, 155	3jca 1208	1 ⊢ (𝜑 → (𝑆 ⊆ ω ∧ 𝐺:𝑆–onto→𝐴 ∧ ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   ∧ w3a 1009   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  {crab 2532  Vcvv 2821   ∪ cun 3218   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  {csn 3708  ωcom 4735   × cxp 4770  ^◡ccnv 4771  dom cdm 4772  ran crn 4773   “ cima 4775   ∘ ccom 4776  Fun wfun 5369   Fn wfn 5370  ⟶wf 5371  –onto→wfo 5373  –1-1-onto→wf1o 5374  ‘cfv 5375  1_oc1o 6674   ⊔ cdju 7371  inlcinl 7379  inrcinr 7380

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-suc 4514  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-1st 6368  df-2nd 6369  df-1o 6681  df-dju 7372  df-inl 7381  df-inr 7382

This theorem is referenced by:  ctssdclemr  7446  ctiunct  13314