Theorem ctssdclemn0 7300

Description: Lemma for ctssdc 7303. The ¬ ∅ ∈ 𝑆 case. (Contributed by Jim Kingdon, 16-Aug-2023.)

Hypotheses

Ref	Expression
ctssdclemn0.ss	⊢ (𝜑 → 𝑆 ⊆ ω)
ctssdclemn0.dc	⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
ctssdclemn0.f	⊢ (𝜑 → 𝐹:𝑆–onto→𝐴)
ctssdclemn0.n0	⊢ (𝜑 → ¬ ∅ ∈ 𝑆)

Assertion

Ref	Expression
ctssdclemn0	⊢ (𝜑 → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))

Distinct variable groups:   𝐴,𝑔   𝑔,𝐹   𝑆,𝑔   𝑆,𝑛

Allowed substitution hints:   𝜑(𝑔,𝑛)   𝐴(𝑛)   𝐹(𝑛)

Proof of Theorem ctssdclemn0

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

Step	Hyp	Ref	Expression
1		ctssdclemn0.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑆–onto→𝐴)
2	1	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ 𝑚 ∈ 𝑆) → 𝐹:𝑆–onto→𝐴)
3		fof 5556	. . . . . . . 8 ⊢ (𝐹:𝑆–onto→𝐴 → 𝐹:𝑆⟶𝐴)
4	2, 3	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ 𝑚 ∈ 𝑆) → 𝐹:𝑆⟶𝐴)
5		simpr 110	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ 𝑚 ∈ 𝑆) → 𝑚 ∈ 𝑆)
6	4, 5	ffvelcdmd 5779	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ 𝑚 ∈ 𝑆) → (𝐹‘𝑚) ∈ 𝐴)
7		djulcl 7241	. . . . . 6 ⊢ ((𝐹‘𝑚) ∈ 𝐴 → (inl‘(𝐹‘𝑚)) ∈ (𝐴 ⊔ 1o))
8	6, 7	syl 14	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ 𝑚 ∈ 𝑆) → (inl‘(𝐹‘𝑚)) ∈ (𝐴 ⊔ 1o))
9		0lt1o 6603	. . . . . . 7 ⊢ ∅ ∈ 1o
10		djurcl 7242	. . . . . . 7 ⊢ (∅ ∈ 1o → (inr‘∅) ∈ (𝐴 ⊔ 1o))
11	9, 10	ax-mp 5	. . . . . 6 ⊢ (inr‘∅) ∈ (𝐴 ⊔ 1o)
12	11	a1i 9	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ 𝑚 ∈ 𝑆) → (inr‘∅) ∈ (𝐴 ⊔ 1o))
13		eleq1 2292	. . . . . . 7 ⊢ (𝑛 = 𝑚 → (𝑛 ∈ 𝑆 ↔ 𝑚 ∈ 𝑆))
14	13	dcbid 843	. . . . . 6 ⊢ (𝑛 = 𝑚 → (DECID 𝑛 ∈ 𝑆 ↔ DECID 𝑚 ∈ 𝑆))
15		ctssdclemn0.dc	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
16	15	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
17		simpr 110	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝑚 ∈ ω)
18	14, 16, 17	rspcdva 2913	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID 𝑚 ∈ 𝑆)
19	8, 12, 18	ifcldadc 3633	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)) ∈ (𝐴 ⊔ 1o))
20	19	fmpttd 5798	. . 3 ⊢ (𝜑 → (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω⟶(𝐴 ⊔ 1o))
21	1	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → 𝐹:𝑆–onto→𝐴)
22		simplr 528	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → 𝑧 ∈ 𝐴)
23		foelrn 5888	. . . . . . . . 9 ⊢ ((𝐹:𝑆–onto→𝐴 ∧ 𝑧 ∈ 𝐴) → ∃𝑦 ∈ 𝑆 𝑧 = (𝐹‘𝑦))
24	21, 22, 23	syl2anc 411	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → ∃𝑦 ∈ 𝑆 𝑧 = (𝐹‘𝑦))
25		simplr 528	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑦 ∈ 𝑆)
26	25	iftrued 3610	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → if(𝑦 ∈ 𝑆, (inl‘(𝐹‘𝑦)), (inr‘∅)) = (inl‘(𝐹‘𝑦)))
27		eqid 2229	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))) = (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))
28		eleq1 2292	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑦 → (𝑚 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆))
29		2fveq3 5640	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑦 → (inl‘(𝐹‘𝑚)) = (inl‘(𝐹‘𝑦)))
30	28, 29	ifbieq1d 3626	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑦 → if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)) = if(𝑦 ∈ 𝑆, (inl‘(𝐹‘𝑦)), (inr‘∅)))
31		ctssdclemn0.ss	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ⊆ ω)
32	31	ad5antr 496	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑆 ⊆ ω)
33	32, 25	sseldd 3226	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑦 ∈ ω)
34	1, 3	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹:𝑆⟶𝐴)
35	34	ad5antr 496	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝐹:𝑆⟶𝐴)
36	35, 25	ffvelcdmd 5779	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → (𝐹‘𝑦) ∈ 𝐴)
37		djulcl 7241	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑦) ∈ 𝐴 → (inl‘(𝐹‘𝑦)) ∈ (𝐴 ⊔ 1o))
38	36, 37	syl 14	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → (inl‘(𝐹‘𝑦)) ∈ (𝐴 ⊔ 1o))
39	26, 38	eqeltrd 2306	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → if(𝑦 ∈ 𝑆, (inl‘(𝐹‘𝑦)), (inr‘∅)) ∈ (𝐴 ⊔ 1o))
40	27, 30, 33, 39	fvmptd3 5736	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦) = if(𝑦 ∈ 𝑆, (inl‘(𝐹‘𝑦)), (inr‘∅)))
41		simpllr 534	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑥 = (inl‘𝑧))
42		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑧 = (𝐹‘𝑦))
43	42	fveq2d 5639	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → (inl‘𝑧) = (inl‘(𝐹‘𝑦)))
44	41, 43	eqtrd 2262	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑥 = (inl‘(𝐹‘𝑦)))
45	26, 40, 44	3eqtr4rd 2273	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) ∧ 𝑧 = (𝐹‘𝑦)) → 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
46	45	ex 115	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) ∧ 𝑦 ∈ 𝑆) → (𝑧 = (𝐹‘𝑦) → 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
47	46	reximdva 2632	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → (∃𝑦 ∈ 𝑆 𝑧 = (𝐹‘𝑦) → ∃𝑦 ∈ 𝑆 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
48	24, 47	mpd 13	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → ∃𝑦 ∈ 𝑆 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
49		ssrexv 3290	. . . . . . . . 9 ⊢ (𝑆 ⊆ ω → (∃𝑦 ∈ 𝑆 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
50	31, 49	syl 14	. . . . . . . 8 ⊢ (𝜑 → (∃𝑦 ∈ 𝑆 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
51	50	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → (∃𝑦 ∈ 𝑆 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
52	48, 51	mpd 13	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑧)) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
53	52	rexlimdva2 2651	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) → (∃𝑧 ∈ 𝐴 𝑥 = (inl‘𝑧) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
54		peano1 4690	. . . . . . . 8 ⊢ ∅ ∈ ω
55	54	a1i 9	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → ∅ ∈ ω)
56		ctssdclemn0.n0	. . . . . . . . . 10 ⊢ (𝜑 → ¬ ∅ ∈ 𝑆)
57	56	ad3antrrr 492	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → ¬ ∅ ∈ 𝑆)
58	57	iffalsed 3613	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → if(∅ ∈ 𝑆, (inl‘(𝐹‘∅)), (inr‘∅)) = (inr‘∅))
59		eleq1 2292	. . . . . . . . . 10 ⊢ (𝑚 = ∅ → (𝑚 ∈ 𝑆 ↔ ∅ ∈ 𝑆))
60		2fveq3 5640	. . . . . . . . . 10 ⊢ (𝑚 = ∅ → (inl‘(𝐹‘𝑚)) = (inl‘(𝐹‘∅)))
61	59, 60	ifbieq1d 3626	. . . . . . . . 9 ⊢ (𝑚 = ∅ → if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)) = if(∅ ∈ 𝑆, (inl‘(𝐹‘∅)), (inr‘∅)))
62	58, 11	eqeltrdi 2320	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → if(∅ ∈ 𝑆, (inl‘(𝐹‘∅)), (inr‘∅)) ∈ (𝐴 ⊔ 1o))
63	27, 61, 55, 62	fvmptd3 5736	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘∅) = if(∅ ∈ 𝑆, (inl‘(𝐹‘∅)), (inr‘∅)))
64		simpr 110	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → 𝑥 = (inr‘𝑧))
65		simplr 528	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → 𝑧 ∈ 1o)
66		el1o 6600	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 1o ↔ 𝑧 = ∅)
67	65, 66	sylib 122	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → 𝑧 = ∅)
68	67	fveq2d 5639	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → (inr‘𝑧) = (inr‘∅))
69	64, 68	eqtrd 2262	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → 𝑥 = (inr‘∅))
70	58, 63, 69	3eqtr4rd 2273	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘∅))
71		fveq2 5635	. . . . . . . 8 ⊢ (𝑦 = ∅ → ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦) = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘∅))
72	71	rspceeqv 2926	. . . . . . 7 ⊢ ((∅ ∈ ω ∧ 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘∅)) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
73	55, 70, 72	syl2anc 411	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) ∧ 𝑧 ∈ 1o) ∧ 𝑥 = (inr‘𝑧)) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
74	73	rexlimdva2 2651	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) → (∃𝑧 ∈ 1o 𝑥 = (inr‘𝑧) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
75		djur 7259	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ⊔ 1o) ↔ (∃𝑧 ∈ 𝐴 𝑥 = (inl‘𝑧) ∨ ∃𝑧 ∈ 1o 𝑥 = (inr‘𝑧)))
76	75	biimpi 120	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ⊔ 1o) → (∃𝑧 ∈ 𝐴 𝑥 = (inl‘𝑧) ∨ ∃𝑧 ∈ 1o 𝑥 = (inr‘𝑧)))
77	76	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) → (∃𝑧 ∈ 𝐴 𝑥 = (inl‘𝑧) ∨ ∃𝑧 ∈ 1o 𝑥 = (inr‘𝑧)))
78	53, 74, 77	mpjaod 723	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ⊔ 1o)) → ∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
79	78	ralrimiva 2603	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴 ⊔ 1o)∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦))
80		dffo3 5790	. . 3 ⊢ ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω–onto→(𝐴 ⊔ 1o) ↔ ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω⟶(𝐴 ⊔ 1o) ∧ ∀𝑥 ∈ (𝐴 ⊔ 1o)∃𝑦 ∈ ω 𝑥 = ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅)))‘𝑦)))
81	20, 79, 80	sylanbrc 417	. 2 ⊢ (𝜑 → (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω–onto→(𝐴 ⊔ 1o))
82		omex 4689	. . . 4 ⊢ ω ∈ V
83	82	mptex 5875	. . 3 ⊢ (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))) ∈ V
84		foeq1 5552	. . 3 ⊢ (𝑔 = (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))) → (𝑔:ω–onto→(𝐴 ⊔ 1o) ↔ (𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω–onto→(𝐴 ⊔ 1o)))
85	83, 84	spcev 2899	. 2 ⊢ ((𝑚 ∈ ω ↦ if(𝑚 ∈ 𝑆, (inl‘(𝐹‘𝑚)), (inr‘∅))):ω–onto→(𝐴 ⊔ 1o) → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))
86	81, 85	syl 14	1 ⊢ (𝜑 → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 713  DECID wdc 839   = wceq 1395  ∃wex 1538   ∈ wcel 2200  ∀wral 2508  ∃wrex 2509   ⊆ wss 3198  ∅c0 3492  ifcif 3603   ↦ cmpt 4148  ωcom 4686  ⟶wf 5320  –onto→wfo 5322  ‘cfv 5324  1_oc1o 6570   ⊔ cdju 7227  inlcinl 7235  inrcinr 7236

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-iinf 4684

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1st 6298  df-2nd 6299  df-1o 6577  df-dju 7228  df-inl 7237  df-inr 7238

This theorem is referenced by:  ctssdc  7303