Theorem padct 32810

Description: Index a countable set with integers and pad with 𝑍. (Contributed by Thierry Arnoux, 1-Jun-2020.) Avoid ax-rep 5199. (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 8919	. 2 ⊢ (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω))
2		isfinite2 9198	. . . . . . . . . 10 ⊢ (𝐴 ≺ ω → 𝐴 ∈ Fin)
3		isfinite4 14315	. . . . . . . . . 10 ⊢ (𝐴 ∈ Fin ↔ (1...(♯‘𝐴)) ≈ 𝐴)
4	2, 3	sylib 219	. . . . . . . . 9 ⊢ (𝐴 ≺ ω → (1...(♯‘𝐴)) ≈ 𝐴)
5	4	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (1...(♯‘𝐴)) ≈ 𝐴)
6		bren 8893	. . . . . . . 8 ⊢ ((1...(♯‘𝐴)) ≈ 𝐴 ↔ ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
7	5, 6	sylib 219	. . . . . . 7 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
8	7	3adant3 1138	. . . . . 6 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑔 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
9		f1of 6767	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))⟶𝐴)
10	9	adantl 482	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))⟶𝐴)
11		fconstmpt 5680	. . . . . . . . . . . 12 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)
12	11	eqcomi 2748	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
13		fconst2g 7147	. . . . . . . . . . . 12 ⊢ (𝑍 ∈ 𝑉 → ((𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})))
14	13	ad2antlr 733	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})))
15	12, 14	mpbiri 259	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍})
16		disjdif 4400	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅
17	16	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅)
18		fun 6689	. . . . . . . . . 10 ⊢ (((𝑔:(1...(♯‘𝐴))⟶𝐴 ∧ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(♯‘𝐴)))⟶{𝑍}) ∧ ((1...(♯‘𝐴)) ∩ (ℕ ∖ (1...(♯‘𝐴)))) = ∅) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}))
19	10, 15, 17, 18	syl21anc 843	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}))
20		fz1ssnn 13500	. . . . . . . . . . 11 ⊢ (1...(♯‘𝐴)) ⊆ ℕ
21		undif 4410	. . . . . . . . . . 11 ⊢ ((1...(♯‘𝐴)) ⊆ ℕ ↔ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ)
22	20, 21	mpbi 231	. . . . . . . . . 10 ⊢ ((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴)))) = ℕ
23	22	feq2i 6647	. . . . . . . . 9 ⊢ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):((1...(♯‘𝐴)) ∪ (ℕ ∖ (1...(♯‘𝐴))))⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
24	19, 23	sylib 219	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
25	24	3adantl3 1175	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
26		simpr 485	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴)
27		f1ofo 6774	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → 𝑔:(1...(♯‘𝐴))–onto→𝐴)
28		forn 6742	. . . . . . . . . . 11 ⊢ (𝑔:(1...(♯‘𝐴))–onto→𝐴 → ran 𝑔 = 𝐴)
29	26, 27, 28	3syl 18	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ran 𝑔 = 𝐴)
30		ssun1 4107	. . . . . . . . . 10 ⊢ ran 𝑔 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
31	29, 30	eqsstrrdi 3960	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
32		rnun 6096	. . . . . . . . 9 ⊢ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
33	31, 32	sseqtrrdi 3956	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
34	33	3adantl3 1175	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
35		dff1o3 6773	. . . . . . . . . 10 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑔:(1...(♯‘𝐴))–onto→𝐴 ∧ Fun ◡𝑔))
36	35	simprbi 498	. . . . . . . . 9 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → Fun ◡𝑔)
37	36	adantl 482	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → Fun ◡𝑔)
38		cnvun 6093	. . . . . . . . . . . 12 ⊢ ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) = (◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))
39	38	reseq1i 5927	. . . . . . . . . . 11 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)
40		resundir 5946	. . . . . . . . . . 11 ⊢ ((◡𝑔 ∪ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
41	39, 40	eqtri 2762	. . . . . . . . . 10 ⊢ (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴))
42		dff1o4 6775	. . . . . . . . . . . . . . 15 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 ↔ (𝑔 Fn (1...(♯‘𝐴)) ∧ ◡𝑔 Fn 𝐴))
43	42	simprbi 498	. . . . . . . . . . . . . 14 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → ◡𝑔 Fn 𝐴)
44		fnresdm 6604	. . . . . . . . . . . . . 14 ⊢ (◡𝑔 Fn 𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
45	43, 44	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴 → (◡𝑔 ↾ 𝐴) = ◡𝑔)
46	45	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡𝑔 ↾ 𝐴) = ◡𝑔)
47		simpl3 1200	. . . . . . . . . . . . 13 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ¬ 𝑍 ∈ 𝐴)
48	12	cnveqi 5816	. . . . . . . . . . . . . . . 16 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍})
49		cnvxp 6108	. . . . . . . . . . . . . . . 16 ⊢ ◡((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
50	48, 49	eqtri 2762	. . . . . . . . . . . . . . 15 ⊢ ◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) = ({𝑍} × (ℕ ∖ (1...(♯‘𝐴))))
51	50	reseq1i 5927	. . . . . . . . . . . . . 14 ⊢ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴)
52		ineqcom 4139	. . . . . . . . . . . . . . . 16 ⊢ (({𝑍} ∩ 𝐴) = ∅ ↔ (𝐴 ∩ {𝑍}) = ∅)
53		disjsn 4643	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∩ {𝑍}) = ∅ ↔ ¬ 𝑍 ∈ 𝐴)
54	52, 53	sylbbr 237	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑍 ∈ 𝐴 → ({𝑍} ∩ 𝐴) = ∅)
55		xpdisjres 32687	. . . . . . . . . . . . . . 15 ⊢ (({𝑍} ∩ 𝐴) = ∅ → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
56	54, 55	syl 17	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑍 ∈ 𝐴 → (({𝑍} × (ℕ ∖ (1...(♯‘𝐴)))) ↾ 𝐴) = ∅)
57	51, 56	eqtrid 2786	. . . . . . . . . . . . 13 ⊢ (¬ 𝑍 ∈ 𝐴 → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
58	47, 57	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
59	46, 58	uneq12d 4099	. . . . . . . . . . 11 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = (◡𝑔 ∪ ∅))
60		un0 4322	. . . . . . . . . . 11 ⊢ (◡𝑔 ∪ ∅) = ◡𝑔
61	59, 60	eqtrdi 2790	. . . . . . . . . 10 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ((◡𝑔 ↾ 𝐴) ∪ (◡(𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = ◡𝑔)
62	41, 61	eqtrid 2786	. . . . . . . . 9 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ◡𝑔)
63	62	funeqd 6507	. . . . . . . 8 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → (Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴) ↔ Fun ◡𝑔))
64	37, 63	mpbird 258	. . . . . . 7 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
65		vex 3435	. . . . . . . . 9 ⊢ 𝑔 ∈ V
66		nnex 12171	. . . . . . . . . . . 12 ⊢ ℕ ∈ V
67	66	difexi 5258	. . . . . . . . . . 11 ⊢ (ℕ ∖ (1...(♯‘𝐴))) ∈ V
68		snex 5368	. . . . . . . . . . 11 ⊢ {𝑍} ∈ V
69	67, 68	xpex 7696	. . . . . . . . . 10 ⊢ ((ℕ ∖ (1...(♯‘𝐴))) × {𝑍}) ∈ V
70	11, 69	eqeltrri 2836	. . . . . . . . 9 ⊢ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍) ∈ V
71	65, 70	unex 7687	. . . . . . . 8 ⊢ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∈ V
72		feq1 6633	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍})))
73		rneq 5878	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ran 𝑓 = ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
74	73	sseq2d 3947	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (𝐴 ⊆ ran 𝑓 ↔ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍))))
75		cnveq 5815	. . . . . . . . . . 11 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ◡𝑓 = ◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)))
76	75	reseq1d 5930	. . . . . . . . . 10 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (◡𝑓 ↾ 𝐴) = (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
77	76	funeqd 6507	. . . . . . . . 9 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → (Fun (◡𝑓 ↾ 𝐴) ↔ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)))
78	72, 74, 77	3anbi123d 1444	. . . . . . . 8 ⊢ (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) → ((𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)) ↔ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴))))
79	71, 78	spcev 3544	. . . . . . 7 ⊢ (((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ∧ Fun (◡(𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(♯‘𝐴))) ↦ 𝑍)) ↾ 𝐴)) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
80	25, 34, 64, 79	syl3anc 1379	. . . . . 6 ⊢ (((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) ∧ 𝑔:(1...(♯‘𝐴))–1-1-onto→𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
81	8, 80	exlimddv 1942	. . . . 5 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
82	81	3expia 1127	. . . 4 ⊢ ((𝐴 ≺ ω ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
83		nnenom 13933	. . . . . . . 8 ⊢ ℕ ≈ ω
84		ensym 8940	. . . . . . . . 9 ⊢ (𝐴 ≈ ω → ω ≈ 𝐴)
85	84	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ω ≈ 𝐴)
86		entr 8943	. . . . . . . 8 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐴) → ℕ ≈ 𝐴)
87	83, 85, 86	sylancr 593	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ℕ ≈ 𝐴)
88		bren 8893	. . . . . . 7 ⊢ (ℕ ≈ 𝐴 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐴)
89	87, 88	sylib 219	. . . . . 6 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑓 𝑓:ℕ–1-1-onto→𝐴)
90		simpr 485	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝑓:ℕ–1-1-onto→𝐴)
91		f1of 6767	. . . . . . . . . 10 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ⟶𝐴)
92		ssun1 4107	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑍})
93		fss 6671	. . . . . . . . . . 11 ⊢ ((𝑓:ℕ⟶𝐴 ∧ 𝐴 ⊆ (𝐴 ∪ {𝑍})) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
94	92, 93	mpan2 697	. . . . . . . . . 10 ⊢ (𝑓:ℕ⟶𝐴 → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
95	90, 91, 94	3syl 18	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
96		f1ofo 6774	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → 𝑓:ℕ–onto→𝐴)
97		forn 6742	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐴 → ran 𝑓 = 𝐴)
98	90, 96, 97	3syl 18	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ran 𝑓 = 𝐴)
99	98	eqimsscd 3972	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → 𝐴 ⊆ ran 𝑓)
100		f1ocnv 6779	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–1-1-onto→𝐴 → ◡𝑓:𝐴–1-1-onto→ℕ)
101		f1of1 6766	. . . . . . . . . . 11 ⊢ (◡𝑓:𝐴–1-1-onto→ℕ → ◡𝑓:𝐴–1-1→ℕ)
102	90, 100, 101	3syl 18	. . . . . . . . . 10 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → ◡𝑓:𝐴–1-1→ℕ)
103		ssid 3937	. . . . . . . . . . 11 ⊢ 𝐴 ⊆ 𝐴
104		f1ores 6781	. . . . . . . . . . 11 ⊢ ((◡𝑓:𝐴–1-1→ℕ ∧ 𝐴 ⊆ 𝐴) → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
105	103, 104	mpan2 697	. . . . . . . . . 10 ⊢ (◡𝑓:𝐴–1-1→ℕ → (◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴))
106		f1ofun 6769	. . . . . . . . . 10 ⊢ ((◡𝑓 ↾ 𝐴):𝐴–1-1-onto→(◡𝑓 “ 𝐴) → Fun (◡𝑓 ↾ 𝐴))
107	102, 105, 106	3syl 18	. . . . . . . . 9 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → Fun (◡𝑓 ↾ 𝐴))
108	95, 99, 107	3jca 1134	. . . . . . . 8 ⊢ (((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) ∧ 𝑓:ℕ–1-1-onto→𝐴) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
109	108	ex 413	. . . . . . 7 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (𝑓:ℕ–1-1-onto→𝐴 → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
110	109	eximdv 1924	. . . . . 6 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (∃𝑓 𝑓:ℕ–1-1-onto→𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
111	89, 110	mpd 15	. . . . 5 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
112	111	a1d 25	. . . 4 ⊢ ((𝐴 ≈ ω ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
113	82, 112	jaoian 964	. . 3 ⊢ (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍 ∈ 𝑉) → (¬ 𝑍 ∈ 𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴))))
114	113	3impia 1123	. 2 ⊢ (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))
115	1, 114	syl3an1b 1411	1 ⊢ ((𝐴 ≼ ω ∧ 𝑍 ∈ 𝑉 ∧ ¬ 𝑍 ∈ 𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (◡𝑓 ↾ 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 853   ∧ w3a 1092   = wceq 1547  ∃wex 1786   ∈ wcel 2119  Vcvv 3431   ∖ cdif 3880   ∪ cun 3881   ∩ cin 3882   ⊆ wss 3883  ∅c0 4261  {csn 4555   class class class wbr 5072   ↦ cmpt 5153   × cxp 5616  ^◡ccnv 5617  ran crn 5619   ↾ cres 5620   “ cima 5621  Fun wfun 6479   Fn wfn 6480  ⟶wf 6481  –1-1→wf1 6482  –onto→wfo 6483  –1-1-onto→wf1o 6484  ‘cfv 6485  (class class class)co 7356  ωcom 7806   ≈ cen 8880   ≼ cdom 8881   ≺ csdm 8882  Fincfn 8883  1c1 11030  ℕcn 12165  ...cfz 13452  ♯chash 14283

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678  ax-inf2 9553  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-nel 3039  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-lim 6315  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-er 8633  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-hash 14284

This theorem is referenced by:  carsggect  34502