Theorem padct 33004

Description: Index a countable set with integers and pad with 𝑍. (Contributed by Thierry Arnoux, 1-Jun-2020.) Avoid ax-rep 5242. (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 8979	. 2 ⊢ (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω))
2		isfinite2 9258	. . . . . . . . . 10 ⊢ (𝐴 ≺ ω → 𝐴 ∈ Fin)
3		isfinite4 14398	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin ↔ (1...(♯‘𝐴)) ≈ 𝐴)
4	2, 3	sylib 221	. . . . . . . . 9 ⊢ (𝐴 ≺ ω → (1...(♯‘𝐴)) ≈ 𝐴)
5	4	adantr 485	. . . . . . . 8 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (1...(♯‘𝐴)) ≈ 𝐴)
6		bren 8953	. . . . . . . 8 ⊢ ((1...(♯‘𝐴)) ≈ 𝐴 ↔ ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
7	5, 6	sylib 221	. . . . . . 7 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
8	7	3adant3 1148	. . . . . 6 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
9		f1of 6821	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))⟶𝐴)
10	9	adantl 486	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))⟶𝐴)
11		fconstmpt 5724	. . . . . . . . . . . 12 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)
12	11	eqcomi 2778	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
13		fconst2g 7202	. . . . . . . . . . . 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 4438	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅
17	16	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅)
18		fun 6741	. . . . . . . . . 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 13583	. . . . . . . . . . 11 ⊢ (1...(♯‘𝐴)) ⊆ ℕ
21		undif 4448	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ⊆ ℕ ↔ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ)
22	20, 21	mpbi 233	. . . . . . . . . 10 ⊢ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ
23	22	feq2i 6698	. . . . . . . . 9 ⊢ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
24	19, 23	sylib 221	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
25	24	3adantl3 1185	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
26		simpr 489	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
27		f1ofo 6829	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))–onto→𝐴)
28		forn 6796	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–onto→𝐴 → ran 𝑔 = 𝐴)
29	26, 27, 28	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ran 𝑔 = 𝐴)
30		ssun1 4139	. . . . . . . . . 10 ⊢ ran 𝑔 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
31	29, 30	eqsstrrdi 3990	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
32		rnun 6143	. . . . . . . . 9 ⊢ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
33	31, 32	sseqtrrdi 3986	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
34	33	3adantl3 1185	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
35		dff1o3 6828	. . . . . . . . . 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 6140	. . . . . . . . . . . 12 ⊢ ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
39	38	reseq1i 5975	. . . . . . . . . . 11 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)
40		resundir 5994	. . . . . . . . . . 11 ⊢ ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
41	39, 40	eqtri 2792	. . . . . . . . . 10 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
42		dff1o4 6830	. . . . . . . . . . . . . . 15 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑔 Fn (1...(♯‘𝐴)) ∧ ◡𝑔 Fn 𝐴))
43	42	simprbi 502	. . . . . . . . . . . . . 14 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → ◡𝑔 Fn 𝐴)
44		fnresdm 6655	. . . . . . . . . . . . . 14 ⊢ (◡𝑔 Fn 𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
45	43, 44	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
46	45	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡𝑔 ↾ 𝐴) = ◡𝑔)
47		simpl3 1210	. . . . . . . . . . . . 13 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ¬ 𝑍 ∈ 𝐴)
48	12	cnveqi 5861	. . . . . . . . . . . . . . . 16 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
49		cnvxp 6155	. . . . . . . . . . . . . . . 16 ⊢ ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
50	48, 49	eqtri 2792	. . . . . . . . . . . . . . 15 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
51	50	reseq1i 5975	. . . . . . . . . . . . . 14 ⊢ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴)
52		ineqcom 4171	. . . . . . . . . . . . . . . 16 ⊢ (({𝑍} ∩ 𝐴) = ∅ ↔ (𝐴 ∩ {𝑍}) = ∅)
53		disjsn 4682	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∩ {𝑍}) = ∅ ↔ ¬ 𝑍 ∈ 𝐴)
54	52, 53	sylbbr 239	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑍 ∈ 𝐴 → ({𝑍} ∩ 𝐴) = ∅)
55		xpdisjres 32884	. . . . . . . . . . . . . . 15 ⊢ (({𝑍} ∩ 𝐴) = ∅ → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
56	54, 55	syl 18	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑍 ∈ 𝐴 → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
57	51, 56	eqtrid 2816	. . . . . . . . . . . . 13 ⊢ (¬ 𝑍 ∈ 𝐴 → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
58	47, 57	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
59	46, 58	uneq12d 4131	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = (◡𝑔 ∪ ∅))
60		un0 4358	. . . . . . . . . . 11 ⊢ (◡𝑔 ∪ ∅) = ◡𝑔
61	59, 60	eqtrdi 2820	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = ◡𝑔)
62	41, 61	eqtrid 2816	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ◡𝑔)
63	62	funeqd 6559	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) ↔ Fun ◡𝑔))
64	37, 63	mpbird 260	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
65		vex 3467	. . . . . . . . 9 ⊢ 𝑔 ∈ V
66		nnex 12239	. . . . . . . . . . . 12 ⊢ ℕ ∈ V
67	66	difexi 5301	. . . . . . . . . . 11 ⊢ (ℕ ∖ (1...(♯‘𝐴))) ∈ V
68		snex 5411	. . . . . . . . . . 11 ⊢ {𝑍} ∈ V
69	67, 68	xpex 7752	. . . . . . . . . 10 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) ∈ V
70	11, 69	eqeltrri 2866	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ∈ V
71	65, 70	unex 7743	. . . . . . . 8 ⊢ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∈ V
72		feq1 6684	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍})))
73		rneq 5927	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ran 𝑓 = ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
74	73	sseq2d 3977	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝐴 ⊆ ran 𝑓 ↔ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))))
75		cnveq 5860	. . . . . . . . . . 11 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ◡𝑓 = ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
76	75	reseq1d 5978	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (◡𝑓 ↾ 𝐴) = (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
77	76	funeqd 6559	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (Fun (◡𝑓 ↾ 𝐴) ↔ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)))
78	72, 74, 77	3anbi123d 1462	. . . . . . . 8 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ((𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)) ↔ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))))
79	71, 78	spcev 3574	. . . . . . 7 ⊢ (((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
80	25, 34, 64, 79	syl3anc 1396	. . . . . 6 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
81	8, 80	exlimddv 1962	. . . . 5 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
82	81	3expia 1137	. . . 4 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
83		nnenom 14016	. . . . . . . 8 ⊢ ℕ ≈ ω
84		ensym 9000	. . . . . . . . 9 ⊢ (𝐴 ≈ ω → ω ≈ 𝐴)
85	84	adantr 485	. . . . . . . 8 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ω ≈ 𝐴)
86		entr 9003	. . . . . . . 8 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐴) → ℕ ≈ 𝐴)
87	83, 85, 86	sylancr 598	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ℕ ≈ 𝐴)
88		bren 8953	. . . . . . 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 6821	. . . . . . . . . 10 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ⟶𝐴)
92		ssun1 4139	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑍})
93		fss 6723	. . . . . . . . . . 11 ⊢ ((𝑓:ℕ⟶𝐴 ∧ 𝐴 ⊆ (𝐴 ∪ {𝑍})) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
94	92, 93	mpan2 703	. . . . . . . . . 10 ⊢ (𝑓:ℕ⟶𝐴 → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
95	90, 91, 94	3syl 19	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
96		f1ofo 6829	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ–onto→𝐴)
97		forn 6796	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ran 𝑓 = 𝐴)
98	90, 96, 97	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ran 𝑓 = 𝐴)
99	98	eqimsscd 4002	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝐴 ⊆ ran 𝑓)
100		f1ocnv 6834	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → ◡𝑓:𝐴–1-1-onto→ℕ)
101		f1of1 6820	. . . . . . . . . . 11 ⊢ (◡𝑓:𝐴–1-1-onto→ℕ → ◡𝑓:𝐴–1-1→ℕ)
102	90, 100, 101	3syl 19	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ◡𝑓:𝐴–1-1→ℕ)
103		ssid 3967	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ 𝐴
104		f1ores 6836	. . . . . . . . . . 11 ⊢ ((◡𝑓:𝐴–1-1→ℕ ∧ 𝐴 ⊆ 𝐴) → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
105	103, 104	mpan2 703	. . . . . . . . . 10 ⊢ (◡𝑓:𝐴–1-1→ℕ → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
106		f1ofun 6823	. . . . . . . . . 10 ⊢ ((◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴) → Fun (◡𝑓 ↾ 𝐴))
107	102, 105, 106	3syl 19	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → Fun (◡𝑓 ↾ 𝐴))
108	95, 99, 107	3jca 1144	. . . . . . . 8 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
109	108	ex 417	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (𝑓:ℕ–1-1-onto→𝐴 → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
110	109	eximdv 1944	. . . . . 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 1133	. 2 ⊢ (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
115	1, 114	syl3an1b 1428	1 ⊢ ((𝐴 ≼ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101   = wceq 1567  ∃wex 1806   ∈ wcel 2149  Vcvv 3463   ∖ cdif 3910   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  ∅c0 4294  {csn 4594   class class class wbr 5113   ↦ cmpt 5196   × cxp 5660  ^◡ccnv 5661  ran crn 5663   ↾ cres 5664   “ cima 5665  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  –1-1→wf1 6534  –onto→wfo 6535  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7411  ωcom 7862   ≈ cen 8940   ≼ cdom 8941   ≺ csdm 8942  Fincfn 8943  1c1 11101  ℕcn 12233  ...cfz 13535  ♯chash 14366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-inf2 9610  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-card 9925  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-n0 12505  df-z 12592  df-uz 12863  df-fz 13536  df-hash 14367

This theorem is referenced by:  carsggect  34653