Theorem ctmlemr 7106

Description: Lemma for ctm 7107. One of the directions of the biconditional. (Contributed by Jim Kingdon, 16-Mar-2023.)

Assertion

Ref	Expression
ctmlemr	⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∃𝑓 𝑓:ω–onto→𝐴 → ∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1o)))

Distinct variable groups:   𝐴,𝑓   𝑥,𝑓

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem ctmlemr

Dummy variables 𝑔 𝑛 𝑢 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		0lt1o 6440	. . . . . . . . . 10 ⊢ ∅ ∈ 1o
2		djurcl 7050	. . . . . . . . . 10 ⊢ (∅ ∈ 1o → (inr‘∅) ∈ (𝐴 ⊔ 1o))
3	1, 2	ax-mp 5	. . . . . . . . 9 ⊢ (inr‘∅) ∈ (𝐴 ⊔ 1o)
4	3	a1i 9	. . . . . . . 8 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ 𝑛 = ∅) → (inr‘∅) ∈ (𝐴 ⊔ 1o))
5		simpllr 534	. . . . . . . . . . 11 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ ¬ 𝑛 = ∅) → 𝑓:ω–onto→𝐴)
6		fof 5438	. . . . . . . . . . 11 ⊢ (𝑓:ω–onto→𝐴 → 𝑓:ω⟶𝐴)
7	5, 6	syl 14	. . . . . . . . . 10 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ ¬ 𝑛 = ∅) → 𝑓:ω⟶𝐴)
8		nnpredcl 4622	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ω → ∪ 𝑛 ∈ ω)
9	8	ad2antlr 489	. . . . . . . . . 10 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ ¬ 𝑛 = ∅) → ∪ 𝑛 ∈ ω)
10	7, 9	ffvelcdmd 5652	. . . . . . . . 9 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ ¬ 𝑛 = ∅) → (𝑓‘∪ 𝑛) ∈ 𝐴)
11		djulcl 7049	. . . . . . . . 9 ⊢ ((𝑓‘∪ 𝑛) ∈ 𝐴 → (inl‘(𝑓‘∪ 𝑛)) ∈ (𝐴 ⊔ 1o))
12	10, 11	syl 14	. . . . . . . 8 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) ∧ ¬ 𝑛 = ∅) → (inl‘(𝑓‘∪ 𝑛)) ∈ (𝐴 ⊔ 1o))
13		nndceq0 4617	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → DECID 𝑛 = ∅)
14	13	adantl 277	. . . . . . . 8 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) → DECID 𝑛 = ∅)
15	4, 12, 14	ifcldadc 3563	. . . . . . 7 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑛 ∈ ω) → if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))) ∈ (𝐴 ⊔ 1o))
16	15	fmpttd 5671	. . . . . 6 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) → (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω⟶(𝐴 ⊔ 1o))
17		simpllr 534	. . . . . . . . . . 11 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) → 𝑓:ω–onto→𝐴)
18		simprl 529	. . . . . . . . . . 11 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) → 𝑤 ∈ 𝐴)
19		foelrn 5753	. . . . . . . . . . 11 ⊢ ((𝑓:ω–onto→𝐴 ∧ 𝑤 ∈ 𝐴) → ∃𝑢 ∈ ω 𝑤 = (𝑓‘𝑢))
20	17, 18, 19	syl2anc 411	. . . . . . . . . 10 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) → ∃𝑢 ∈ ω 𝑤 = (𝑓‘𝑢))
21		peano2 4594	. . . . . . . . . . . 12 ⊢ (𝑢 ∈ ω → suc 𝑢 ∈ ω)
22	21	ad2antrl 490	. . . . . . . . . . 11 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → suc 𝑢 ∈ ω)
23		simplrr 536	. . . . . . . . . . . . . 14 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑦 = (inl‘𝑤))
24		simprl 529	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑢 ∈ ω)
25		nnord 4611	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ ω → Ord 𝑢)
26		ordtr 4378	. . . . . . . . . . . . . . . . . . 19 ⊢ (Ord 𝑢 → Tr 𝑢)
27	24, 25, 26	3syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → Tr 𝑢)
28		unisucg 4414	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ ω → (Tr 𝑢 ↔ ∪ suc 𝑢 = 𝑢))
29	28	ad2antrl 490	. . . . . . . . . . . . . . . . . 18 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → (Tr 𝑢 ↔ ∪ suc 𝑢 = 𝑢))
30	27, 29	mpbid 147	. . . . . . . . . . . . . . . . 17 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → ∪ suc 𝑢 = 𝑢)
31	30	fveq2d 5519	. . . . . . . . . . . . . . . 16 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → (𝑓‘∪ suc 𝑢) = (𝑓‘𝑢))
32		simprr 531	. . . . . . . . . . . . . . . 16 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑤 = (𝑓‘𝑢))
33	31, 32	eqtr4d 2213	. . . . . . . . . . . . . . 15 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → (𝑓‘∪ suc 𝑢) = 𝑤)
34	33	fveq2d 5519	. . . . . . . . . . . . . 14 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → (inl‘(𝑓‘∪ suc 𝑢)) = (inl‘𝑤))
35	23, 34	eqtr4d 2213	. . . . . . . . . . . . 13 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑦 = (inl‘(𝑓‘∪ suc 𝑢)))
36		peano3 4595	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ ω → suc 𝑢 ≠ ∅)
37	36	neneqd 2368	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ ω → ¬ suc 𝑢 = ∅)
38	37	ad2antrl 490	. . . . . . . . . . . . . 14 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → ¬ suc 𝑢 = ∅)
39	38	iffalsed 3544	. . . . . . . . . . . . 13 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → if(suc 𝑢 = ∅, (inr‘∅), (inl‘(𝑓‘∪ suc 𝑢))) = (inl‘(𝑓‘∪ suc 𝑢)))
40	35, 39	eqtr4d 2213	. . . . . . . . . . . 12 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑦 = if(suc 𝑢 = ∅, (inr‘∅), (inl‘(𝑓‘∪ suc 𝑢))))
41		eqid 2177	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))) = (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))
42		eqeq1 2184	. . . . . . . . . . . . . 14 ⊢ (𝑛 = suc 𝑢 → (𝑛 = ∅ ↔ suc 𝑢 = ∅))
43		unieq 3818	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = suc 𝑢 → ∪ 𝑛 = ∪ suc 𝑢)
44	43	fveq2d 5519	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = suc 𝑢 → (𝑓‘∪ 𝑛) = (𝑓‘∪ suc 𝑢))
45	44	fveq2d 5519	. . . . . . . . . . . . . 14 ⊢ (𝑛 = suc 𝑢 → (inl‘(𝑓‘∪ 𝑛)) = (inl‘(𝑓‘∪ suc 𝑢)))
46	42, 45	ifbieq2d 3558	. . . . . . . . . . . . 13 ⊢ (𝑛 = suc 𝑢 → if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))) = if(suc 𝑢 = ∅, (inr‘∅), (inl‘(𝑓‘∪ suc 𝑢))))
47		simpllr 534	. . . . . . . . . . . . . 14 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑦 ∈ (𝐴 ⊔ 1o))
48	40, 47	eqeltrrd 2255	. . . . . . . . . . . . 13 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → if(suc 𝑢 = ∅, (inr‘∅), (inl‘(𝑓‘∪ suc 𝑢))) ∈ (𝐴 ⊔ 1o))
49	41, 46, 22, 48	fvmptd3 5609	. . . . . . . . . . . 12 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘suc 𝑢) = if(suc 𝑢 = ∅, (inr‘∅), (inl‘(𝑓‘∪ suc 𝑢))))
50	40, 49	eqtr4d 2213	. . . . . . . . . . 11 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘suc 𝑢))
51		fveq2 5515	. . . . . . . . . . . 12 ⊢ (𝑧 = suc 𝑢 → ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧) = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘suc 𝑢))
52	51	rspceeqv 2859	. . . . . . . . . . 11 ⊢ ((suc 𝑢 ∈ ω ∧ 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘suc 𝑢)) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
53	22, 50, 52	syl2anc 411	. . . . . . . . . 10 ⊢ (((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) ∧ (𝑢 ∈ ω ∧ 𝑤 = (𝑓‘𝑢))) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
54	20, 53	rexlimddv 2599	. . . . . . . . 9 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑤))) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
55	54	rexlimdvaa 2595	. . . . . . . 8 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) → (∃𝑤 ∈ 𝐴 𝑦 = (inl‘𝑤) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧)))
56		peano1 4593	. . . . . . . . . 10 ⊢ ∅ ∈ ω
57		simprr 531	. . . . . . . . . . . . 13 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑦 = (inr‘𝑤))
58		simprl 529	. . . . . . . . . . . . . . 15 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑤 ∈ 1o)
59		el1o 6437	. . . . . . . . . . . . . . 15 ⊢ (𝑤 ∈ 1o ↔ 𝑤 = ∅)
60	58, 59	sylib 122	. . . . . . . . . . . . . 14 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑤 = ∅)
61	60	fveq2d 5519	. . . . . . . . . . . . 13 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → (inr‘𝑤) = (inr‘∅))
62	57, 61	eqtrd 2210	. . . . . . . . . . . 12 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑦 = (inr‘∅))
63		eqid 2177	. . . . . . . . . . . . 13 ⊢ ∅ = ∅
64	63	iftruei 3540	. . . . . . . . . . . 12 ⊢ if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))) = (inr‘∅)
65	62, 64	eqtr4di 2228	. . . . . . . . . . 11 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑦 = if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))))
66	64, 3	eqeltri 2250	. . . . . . . . . . . . 13 ⊢ if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))) ∈ (𝐴 ⊔ 1o)
67	66	a1i 9	. . . . . . . . . . . 12 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))) ∈ (𝐴 ⊔ 1o))
68		eqeq1 2184	. . . . . . . . . . . . . 14 ⊢ (𝑛 = ∅ → (𝑛 = ∅ ↔ ∅ = ∅))
69		unieq 3818	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = ∅ → ∪ 𝑛 = ∪ ∅)
70	69	fveq2d 5519	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = ∅ → (𝑓‘∪ 𝑛) = (𝑓‘∪ ∅))
71	70	fveq2d 5519	. . . . . . . . . . . . . 14 ⊢ (𝑛 = ∅ → (inl‘(𝑓‘∪ 𝑛)) = (inl‘(𝑓‘∪ ∅)))
72	68, 71	ifbieq2d 3558	. . . . . . . . . . . . 13 ⊢ (𝑛 = ∅ → if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))) = if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))))
73	72, 41	fvmptg 5592	. . . . . . . . . . . 12 ⊢ ((∅ ∈ ω ∧ if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))) ∈ (𝐴 ⊔ 1o)) → ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘∅) = if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))))
74	56, 67, 73	sylancr 414	. . . . . . . . . . 11 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘∅) = if(∅ = ∅, (inr‘∅), (inl‘(𝑓‘∪ ∅))))
75	65, 74	eqtr4d 2213	. . . . . . . . . 10 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘∅))
76		fveq2 5515	. . . . . . . . . . 11 ⊢ (𝑧 = ∅ → ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧) = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘∅))
77	76	rspceeqv 2859	. . . . . . . . . 10 ⊢ ((∅ ∈ ω ∧ 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘∅)) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
78	56, 75, 77	sylancr 414	. . . . . . . . 9 ⊢ ((((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) ∧ (𝑤 ∈ 1o ∧ 𝑦 = (inr‘𝑤))) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
79	78	rexlimdvaa 2595	. . . . . . . 8 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) → (∃𝑤 ∈ 1o 𝑦 = (inr‘𝑤) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧)))
80		djur 7067	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝐴 ⊔ 1o) ↔ (∃𝑤 ∈ 𝐴 𝑦 = (inl‘𝑤) ∨ ∃𝑤 ∈ 1o 𝑦 = (inr‘𝑤)))
81	80	biimpi 120	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐴 ⊔ 1o) → (∃𝑤 ∈ 𝐴 𝑦 = (inl‘𝑤) ∨ ∃𝑤 ∈ 1o 𝑦 = (inr‘𝑤)))
82	81	adantl 277	. . . . . . . 8 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) → (∃𝑤 ∈ 𝐴 𝑦 = (inl‘𝑤) ∨ ∃𝑤 ∈ 1o 𝑦 = (inr‘𝑤)))
83	55, 79, 82	mpjaod 718	. . . . . . 7 ⊢ (((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) ∧ 𝑦 ∈ (𝐴 ⊔ 1o)) → ∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
84	83	ralrimiva 2550	. . . . . 6 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) → ∀𝑦 ∈ (𝐴 ⊔ 1o)∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧))
85		dffo3 5663	. . . . . 6 ⊢ ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω–onto→(𝐴 ⊔ 1o) ↔ ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω⟶(𝐴 ⊔ 1o) ∧ ∀𝑦 ∈ (𝐴 ⊔ 1o)∃𝑧 ∈ ω 𝑦 = ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛))))‘𝑧)))
86	16, 84, 85	sylanbrc 417	. . . . 5 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) → (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω–onto→(𝐴 ⊔ 1o))
87		omex 4592	. . . . . . 7 ⊢ ω ∈ V
88	87	mptex 5742	. . . . . 6 ⊢ (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))) ∈ V
89		foeq1 5434	. . . . . 6 ⊢ (𝑔 = (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))) → (𝑔:ω–onto→(𝐴 ⊔ 1o) ↔ (𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω–onto→(𝐴 ⊔ 1o)))
90	88, 89	spcev 2832	. . . . 5 ⊢ ((𝑛 ∈ ω ↦ if(𝑛 = ∅, (inr‘∅), (inl‘(𝑓‘∪ 𝑛)))):ω–onto→(𝐴 ⊔ 1o) → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))
91	86, 90	syl 14	. . . 4 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ 𝑓:ω–onto→𝐴) → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))
92	91	ex 115	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝑓:ω–onto→𝐴 → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o)))
93	92	exlimdv 1819	. 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∃𝑓 𝑓:ω–onto→𝐴 → ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o)))
94		foeq1 5434	. . 3 ⊢ (𝑓 = 𝑔 → (𝑓:ω–onto→(𝐴 ⊔ 1o) ↔ 𝑔:ω–onto→(𝐴 ⊔ 1o)))
95	94	cbvexv 1918	. 2 ⊢ (∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1o) ↔ ∃𝑔 𝑔:ω–onto→(𝐴 ⊔ 1o))
96	93, 95	imbitrrdi 162	1 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∃𝑓 𝑓:ω–onto→𝐴 → ∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1o)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 708  DECID wdc 834   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ∀wral 2455  ∃wrex 2456  ∅c0 3422  ifcif 3534  ∪ cuni 3809   ↦ cmpt 4064  Tr wtr 4101  Ord word 4362  suc csuc 4365  ωcom 4589  ⟶wf 5212  –onto→wfo 5214  ‘cfv 5216  1_oc1o 6409   ⊔ cdju 7035  inlcinl 7043  inrcinr 7044

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4118  ax-sep 4121  ax-nul 4129  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-iinf 4587

This theorem depends on definitions:  df-bi 117  df-dc 835  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  df-iord 4366  df-on 4368  df-suc 4371  df-iom 4590  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-1st 6140  df-2nd 6141  df-1o 6416  df-dju 7036  df-inl 7045  df-inr 7046

This theorem is referenced by:  ctm  7107