Theorem padct 33063

Description: Index a countable set with integers and pad with 𝑍. (Contributed by Thierry Arnoux, 1-Jun-2020.) Avoid ax-rep 5238. (Revised by GG, 2-Apr-2026.)

Assertion

Ref	Expression
padct	⊢ ((𝐴 ≼ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))

Distinct variable groups:   𝐴,𝑓   𝑓,𝑉   𝑓,𝑍

Proof of Theorem padct

Dummy variables 𝑔 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdom2 8975	. 2 ⊢ (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω))
2		isfinite2 9254	. . . . . . . . . 10 ⊢ (𝐴 ≺ ω → 𝐴 ∈ Fin)
3		isfinite4 14394	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin ↔ (1...(♯‘𝐴)) ≈ 𝐴)
4	2, 3	sylib 221	. . . . . . . . 9 ⊢ (𝐴 ≺ ω → (1...(♯‘𝐴)) ≈ 𝐴)
5	4	adantr 485	. . . . . . . 8 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (1...(♯‘𝐴)) ≈ 𝐴)
6		bren 8949	. . . . . . . 8 ⊢ ((1...(♯‘𝐴)) ≈ 𝐴 ↔ ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
7	5, 6	sylib 221	. . . . . . 7 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
8	7	3adant3 1150	. . . . . 6 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
9		f1of 6820	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))⟶𝐴)
10	9	adantl 486	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))⟶𝐴)
11		fconstmpt 5723	. . . . . . . . . . . 12 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)
12	11	eqcomi 2772	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
13		fconst2g 7201	. . . . . . . . . . . 12 ⊢ (𝑍 ∈ 𝑉 → ((𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})))
14	13	ad2antlr 739	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})))
15	12, 14	mpbiri 261	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍})
16		disjdif 4433	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅
17	16	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅)
18		fun 6740	. . . . . . . . . 10 ⊢ (((𝑔:(1...(♯‘𝐴))⟶𝐴 ∧ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍}) ∧ ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}))
19	10, 15, 17, 18	syl21anc 850	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}))
20		fz1ssnn 13579	. . . . . . . . . . 11 ⊢ (1...(♯‘𝐴)) ⊆ ℕ
21		undif 4443	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ⊆ ℕ ↔ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ)
22	20, 21	mpbi 233	. . . . . . . . . 10 ⊢ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ
23	22	feq2i 6697	. . . . . . . . 9 ⊢ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
24	19, 23	sylib 221	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
25	24	3adantl3 1187	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
26		simpr 489	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
27		f1ofo 6828	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))–onto→𝐴)
28		forn 6795	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–onto→𝐴 → ran 𝑔 = 𝐴)
29	26, 27, 28	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ran 𝑔 = 𝐴)
30		ssun1 4131	. . . . . . . . . 10 ⊢ ran 𝑔 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
31	29, 30	eqsstrrdi 3982	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
32		rnun 6142	. . . . . . . . 9 ⊢ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
33	31, 32	sseqtrrdi 3978	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
34	33	3adantl3 1187	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
35		dff1o3 6827	. . . . . . . . . 10 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑔:(1...(♯‘𝐴))–onto→𝐴 ∧ Fun ◡𝑔))
36	35	simprbi 502	. . . . . . . . 9 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → Fun ◡𝑔)
37	36	adantl 486	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → Fun ◡𝑔)
38		cnvun 6139	. . . . . . . . . . . 12 ⊢ ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
39	38	reseq1i 5974	. . . . . . . . . . 11 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)
40		resundir 5993	. . . . . . . . . . 11 ⊢ ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
41	39, 40	eqtri 2786	. . . . . . . . . 10 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
42		dff1o4 6829	. . . . . . . . . . . . . . 15 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑔 Fn (1...(♯‘𝐴)) ∧ ◡𝑔 Fn 𝐴))
43	42	simprbi 502	. . . . . . . . . . . . . 14 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → ◡𝑔 Fn 𝐴)
44		fnresdm 6654	. . . . . . . . . . . . . 14 ⊢ (◡𝑔 Fn 𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
45	43, 44	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
46	45	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡𝑔 ↾ 𝐴) = ◡𝑔)
47		simpl3 1212	. . . . . . . . . . . . 13 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ¬ 𝑍 ∈ 𝐴)
48	12	cnveqi 5860	. . . . . . . . . . . . . . . 16 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
49		cnvxp 6154	. . . . . . . . . . . . . . . 16 ⊢ ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
50	48, 49	eqtri 2786	. . . . . . . . . . . . . . 15 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
51	50	reseq1i 5974	. . . . . . . . . . . . . 14 ⊢ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴)
52		ineqcom 4163	. . . . . . . . . . . . . . . 16 ⊢ (({𝑍} ∩ 𝐴) = ∅ ↔ (𝐴 ∩ {𝑍}) = ∅)
53		disjsn 4677	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∩ {𝑍}) = ∅ ↔ ¬ 𝑍 ∈ 𝐴)
54	52, 53	sylbbr 239	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑍 ∈ 𝐴 → ({𝑍} ∩ 𝐴) = ∅)
55		xpdisjres 32943	. . . . . . . . . . . . . . 15 ⊢ (({𝑍} ∩ 𝐴) = ∅ → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
56	54, 55	syl 18	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑍 ∈ 𝐴 → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
57	51, 56	eqtrid 2810	. . . . . . . . . . . . 13 ⊢ (¬ 𝑍 ∈ 𝐴 → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
58	47, 57	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
59	46, 58	uneq12d 4123	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = (◡𝑔 ∪ ∅))
60		un0 4351	. . . . . . . . . . 11 ⊢ (◡𝑔 ∪ ∅) = ◡𝑔
61	59, 60	eqtrdi 2814	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = ◡𝑔)
62	41, 61	eqtrid 2810	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ◡𝑔)
63	62	funeqd 6558	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) ↔ Fun ◡𝑔))
64	37, 63	mpbird 260	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
65		vex 3459	. . . . . . . . 9 ⊢ 𝑔 ∈ V
66		nnex 12234	. . . . . . . . . . . 12 ⊢ ℕ ∈ V
67	66	difexi 5301	. . . . . . . . . . 11 ⊢ (ℕ ∖ (1...(♯‘𝐴))) ∈ V
68		snex 5410	. . . . . . . . . . 11 ⊢ {𝑍} ∈ V
69	67, 68	xpex 7748	. . . . . . . . . 10 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) ∈ V
70	11, 69	eqeltrri 2860	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ∈ V
71	65, 70	unex 7742	. . . . . . . 8 ⊢ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∈ V
72		feq1 6683	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍})))
73		rneq 5926	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ran 𝑓 = ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
74	73	sseq2d 3969	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝐴 ⊆ ran 𝑓 ↔ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))))
75		cnveq 5859	. . . . . . . . . . 11 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ◡𝑓 = ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
76	75	reseq1d 5977	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (◡𝑓 ↾ 𝐴) = (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
77	76	funeqd 6558	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (Fun (◡𝑓 ↾ 𝐴) ↔ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)))
78	72, 74, 77	3anbi123d 1464	. . . . . . . 8 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ((𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)) ↔ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))))
79	71, 78	spcev 3565	. . . . . . 7 ⊢ (((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
80	25, 34, 64, 79	syl3anc 1398	. . . . . 6 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
81	8, 80	exlimddv 1965	. . . . 5 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
82	81	3expia 1139	. . . 4 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
83		nnenom 14012	. . . . . . . 8 ⊢ ℕ ≈ ω
84		ensym 8996	. . . . . . . . 9 ⊢ (𝐴 ≈ ω → ω ≈ 𝐴)
85	84	adantr 485	. . . . . . . 8 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ω ≈ 𝐴)
86		entr 8999	. . . . . . . 8 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐴) → ℕ ≈ 𝐴)
87	83, 85, 86	sylancr 598	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ℕ ≈ 𝐴)
88		bren 8949	. . . . . . 7 ⊢ (ℕ ≈ 𝐴 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐴)
89	87, 88	sylib 221	. . . . . 6 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑓 𝑓:ℕ–1-1-onto→𝐴)
90		simpr 489	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝑓:ℕ–1-1-onto→𝐴)
91		f1of 6820	. . . . . . . . . 10 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ⟶𝐴)
92		ssun1 4131	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑍})
93		fss 6722	. . . . . . . . . . 11 ⊢ ((𝑓:ℕ⟶𝐴 ∧ 𝐴 ⊆ (𝐴 ∪ {𝑍})) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
94	92, 93	mpan2 703	. . . . . . . . . 10 ⊢ (𝑓:ℕ⟶𝐴 → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
95	90, 91, 94	3syl 19	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
96		f1ofo 6828	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ–onto→𝐴)
97		forn 6795	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ran 𝑓 = 𝐴)
98	90, 96, 97	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ran 𝑓 = 𝐴)
99	98	eqimsscd 3994	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝐴 ⊆ ran 𝑓)
100		f1ocnv 6833	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → ◡𝑓:𝐴–1-1-onto→ℕ)
101		f1of1 6819	. . . . . . . . . . 11 ⊢ (◡𝑓:𝐴–1-1-onto→ℕ → ◡𝑓:𝐴–1-1→ℕ)
102	90, 100, 101	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ◡𝑓:𝐴–1-1→ℕ)
103		ssid 3959	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ 𝐴
104		f1ores 6835	. . . . . . . . . . 11 ⊢ ((◡𝑓:𝐴–1-1→ℕ ∧ 𝐴 ⊆ 𝐴) → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
105	103, 104	mpan2 703	. . . . . . . . . 10 ⊢ (◡𝑓:𝐴–1-1→ℕ → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
106		f1ofun 6822	. . . . . . . . . 10 ⊢ ((◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴) → Fun (◡𝑓 ↾ 𝐴))
107	102, 105, 106	3syl 19	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → Fun (◡𝑓 ↾ 𝐴))
108	95, 99, 107	3jca 1146	. . . . . . . 8 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
109	108	ex 417	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (𝑓:ℕ–1-1-onto→𝐴 → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
110	109	eximdv 1947	. . . . . 6 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (∃𝑓 𝑓:ℕ–1-1-onto→𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
111	89, 110	mpd 16	. . . . 5 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
112	111	a1d 26	. . . 4 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
113	82, 112	jaoian 971	. . 3 ⊢ (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
114	113	3impia 1135	. 2 ⊢ (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
115	1, 114	syl3an1b 1430	1 ⊢ ((𝐴 ≼ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1103   = wceq 1570  ∃wex 1809   ∈ wcel 2143  Vcvv 3455   ∖ cdif 3902   ∪ cun 3903   ∩ cin 3904   ⊆ wss 3905  ∅c0 4286  {csn 4589   class class class wbr 5109   ↦ cmpt 5192   × cxp 5659  ^◡ccnv 5660  ran crn 5662   ↾ cres 5663   “ cima 5664  Fun wfun 6530   Fn wfn 6531  ⟶wf 6532  –1-1→wf1 6533  –onto→wfo 6534  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410  ωcom 7858   ≈ cen 8936   ≼ cdom 8937   ≺ csdm 8938  Fincfn 8939  1c1 11096  ℕcn 12228  ...cfz 13530  ♯chash 14362

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-card 9921  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-n0 12500  df-z 12587  df-uz 12858  df-fz 13531  df-hash 14363

This theorem is referenced by:  carsggect  34708