Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  padct Structured version   Visualization version   GIF version

Theorem padct 29497
Description: Index a countable set with integers and pad with 𝑍. (Contributed by Thierry Arnoux, 1-Jun-2020.)
Assertion
Ref Expression
padct ((𝐴 ≼ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
Distinct variable groups:   𝐴,𝑓   𝑓,𝑉   𝑓,𝑍

Proof of Theorem padct
Dummy variables 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 brdom2 7985 . 2 (𝐴 ≼ ω ↔ (𝐴 ≺ ω ∨ 𝐴 ≈ ω))
2 isfinite2 8218 . . . . . . . . . 10 (𝐴 ≺ ω → 𝐴 ∈ Fin)
3 isfinite4 13153 . . . . . . . . . 10 (𝐴 ∈ Fin ↔ (1...(#‘𝐴)) ≈ 𝐴)
42, 3sylib 208 . . . . . . . . 9 (𝐴 ≺ ω → (1...(#‘𝐴)) ≈ 𝐴)
54adantr 481 . . . . . . . 8 ((𝐴 ≺ ω ∧ 𝑍𝑉) → (1...(#‘𝐴)) ≈ 𝐴)
6 bren 7964 . . . . . . . 8 ((1...(#‘𝐴)) ≈ 𝐴 ↔ ∃𝑔 𝑔:(1...(#‘𝐴))–1-1-onto𝐴)
75, 6sylib 208 . . . . . . 7 ((𝐴 ≺ ω ∧ 𝑍𝑉) → ∃𝑔 𝑔:(1...(#‘𝐴))–1-1-onto𝐴)
873adant3 1081 . . . . . 6 ((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → ∃𝑔 𝑔:(1...(#‘𝐴))–1-1-onto𝐴)
9 nfv 1843 . . . . . . 7 𝑔(𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴)
10 nfv 1843 . . . . . . 7 𝑔𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))
11 f1of 6137 . . . . . . . . . . . . 13 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴𝑔:(1...(#‘𝐴))⟶𝐴)
1211adantl 482 . . . . . . . . . . . 12 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝑔:(1...(#‘𝐴))⟶𝐴)
13 fconstmpt 5163 . . . . . . . . . . . . . 14 ((ℕ ∖ (1...(#‘𝐴))) × {𝑍}) = (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)
1413eqcomi 2631 . . . . . . . . . . . . 13 (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(#‘𝐴))) × {𝑍})
15 simplr 792 . . . . . . . . . . . . . 14 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝑍𝑉)
16 fconst2g 6468 . . . . . . . . . . . . . 14 (𝑍𝑉 → ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(#‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(#‘𝐴))) × {𝑍})))
1715, 16syl 17 . . . . . . . . . . . . 13 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(#‘𝐴)))⟶{𝑍} ↔ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(#‘𝐴))) × {𝑍})))
1814, 17mpbiri 248 . . . . . . . . . . . 12 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(#‘𝐴)))⟶{𝑍})
19 disjdif 4040 . . . . . . . . . . . . 13 ((1...(#‘𝐴)) ∩ (ℕ ∖ (1...(#‘𝐴)))) = ∅
2019a1i 11 . . . . . . . . . . . 12 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((1...(#‘𝐴)) ∩ (ℕ ∖ (1...(#‘𝐴)))) = ∅)
21 fun 6066 . . . . . . . . . . . 12 (((𝑔:(1...(#‘𝐴))⟶𝐴 ∧ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍):(ℕ ∖ (1...(#‘𝐴)))⟶{𝑍}) ∧ ((1...(#‘𝐴)) ∩ (ℕ ∖ (1...(#‘𝐴)))) = ∅) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):((1...(#‘𝐴)) ∪ (ℕ ∖ (1...(#‘𝐴))))⟶(𝐴 ∪ {𝑍}))
2212, 18, 20, 21syl21anc 1325 . . . . . . . . . . 11 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):((1...(#‘𝐴)) ∪ (ℕ ∖ (1...(#‘𝐴))))⟶(𝐴 ∪ {𝑍}))
23 fz1ssnn 12372 . . . . . . . . . . . . 13 (1...(#‘𝐴)) ⊆ ℕ
24 undif 4049 . . . . . . . . . . . . 13 ((1...(#‘𝐴)) ⊆ ℕ ↔ ((1...(#‘𝐴)) ∪ (ℕ ∖ (1...(#‘𝐴)))) = ℕ)
2523, 24mpbi 220 . . . . . . . . . . . 12 ((1...(#‘𝐴)) ∪ (ℕ ∖ (1...(#‘𝐴)))) = ℕ
2625feq2i 6037 . . . . . . . . . . 11 ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):((1...(#‘𝐴)) ∪ (ℕ ∖ (1...(#‘𝐴))))⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
2722, 26sylib 208 . . . . . . . . . 10 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
28273adantl3 1219 . . . . . . . . 9 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}))
29 ssid 3624 . . . . . . . . . . . . . 14 𝐴𝐴
30 simpr 477 . . . . . . . . . . . . . . 15 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝑔:(1...(#‘𝐴))–1-1-onto𝐴)
31 f1ofo 6144 . . . . . . . . . . . . . . 15 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴𝑔:(1...(#‘𝐴))–onto𝐴)
32 forn 6118 . . . . . . . . . . . . . . 15 (𝑔:(1...(#‘𝐴))–onto𝐴 → ran 𝑔 = 𝐴)
3330, 31, 323syl 18 . . . . . . . . . . . . . 14 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ran 𝑔 = 𝐴)
3429, 33syl5sseqr 3654 . . . . . . . . . . . . 13 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝐴 ⊆ ran 𝑔)
3534orcd 407 . . . . . . . . . . . 12 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝐴 ⊆ ran 𝑔𝐴 ⊆ ran (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
36 ssun 3792 . . . . . . . . . . . 12 ((𝐴 ⊆ ran 𝑔𝐴 ⊆ ran (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → 𝐴 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
3735, 36syl 17 . . . . . . . . . . 11 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝐴 ⊆ (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
38 rnun 5541 . . . . . . . . . . 11 ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) = (ran 𝑔 ∪ ran (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍))
3937, 38syl6sseqr 3652 . . . . . . . . . 10 (((𝐴 ≺ ω ∧ 𝑍𝑉) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
40393adantl3 1219 . . . . . . . . 9 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
41 dff1o3 6143 . . . . . . . . . . . 12 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴 ↔ (𝑔:(1...(#‘𝐴))–onto𝐴 ∧ Fun 𝑔))
4241simprbi 480 . . . . . . . . . . 11 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴 → Fun 𝑔)
4342adantl 482 . . . . . . . . . 10 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → Fun 𝑔)
44 cnvun 5538 . . . . . . . . . . . . . 14 (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) = (𝑔(𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍))
4544reseq1i 5392 . . . . . . . . . . . . 13 ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((𝑔(𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴)
46 resundir 5411 . . . . . . . . . . . . 13 ((𝑔(𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((𝑔𝐴) ∪ ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴))
4745, 46eqtri 2644 . . . . . . . . . . . 12 ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = ((𝑔𝐴) ∪ ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴))
48 dff1o4 6145 . . . . . . . . . . . . . . . . 17 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴 ↔ (𝑔 Fn (1...(#‘𝐴)) ∧ 𝑔 Fn 𝐴))
4948simprbi 480 . . . . . . . . . . . . . . . 16 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴𝑔 Fn 𝐴)
50 fnresdm 6000 . . . . . . . . . . . . . . . 16 (𝑔 Fn 𝐴 → (𝑔𝐴) = 𝑔)
5149, 50syl 17 . . . . . . . . . . . . . . 15 (𝑔:(1...(#‘𝐴))–1-1-onto𝐴 → (𝑔𝐴) = 𝑔)
5251adantl 482 . . . . . . . . . . . . . 14 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (𝑔𝐴) = 𝑔)
53 simpl3 1066 . . . . . . . . . . . . . . 15 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ¬ 𝑍𝐴)
5414cnveqi 5297 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) = ((ℕ ∖ (1...(#‘𝐴))) × {𝑍})
55 cnvxp 5551 . . . . . . . . . . . . . . . . . 18 ((ℕ ∖ (1...(#‘𝐴))) × {𝑍}) = ({𝑍} × (ℕ ∖ (1...(#‘𝐴))))
5654, 55eqtri 2644 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) = ({𝑍} × (ℕ ∖ (1...(#‘𝐴))))
5756reseq1i 5392 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴) = (({𝑍} × (ℕ ∖ (1...(#‘𝐴)))) ↾ 𝐴)
58 incom 3805 . . . . . . . . . . . . . . . . . 18 (𝐴 ∩ {𝑍}) = ({𝑍} ∩ 𝐴)
59 disjsn 4246 . . . . . . . . . . . . . . . . . . 19 ((𝐴 ∩ {𝑍}) = ∅ ↔ ¬ 𝑍𝐴)
6059biimpri 218 . . . . . . . . . . . . . . . . . 18 𝑍𝐴 → (𝐴 ∩ {𝑍}) = ∅)
6158, 60syl5eqr 2670 . . . . . . . . . . . . . . . . 17 𝑍𝐴 → ({𝑍} ∩ 𝐴) = ∅)
62 xpdisjres 29411 . . . . . . . . . . . . . . . . 17 (({𝑍} ∩ 𝐴) = ∅ → (({𝑍} × (ℕ ∖ (1...(#‘𝐴)))) ↾ 𝐴) = ∅)
6361, 62syl 17 . . . . . . . . . . . . . . . 16 𝑍𝐴 → (({𝑍} × (ℕ ∖ (1...(#‘𝐴)))) ↾ 𝐴) = ∅)
6457, 63syl5eq 2668 . . . . . . . . . . . . . . 15 𝑍𝐴 → ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
6553, 64syl 17 . . . . . . . . . . . . . 14 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴) = ∅)
6652, 65uneq12d 3768 . . . . . . . . . . . . 13 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((𝑔𝐴) ∪ ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = (𝑔 ∪ ∅))
67 un0 3967 . . . . . . . . . . . . 13 (𝑔 ∪ ∅) = 𝑔
6866, 67syl6eq 2672 . . . . . . . . . . . 12 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((𝑔𝐴) ∪ ((𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ↾ 𝐴)) = 𝑔)
6947, 68syl5eq 2668 . . . . . . . . . . 11 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴) = 𝑔)
7069funeqd 5910 . . . . . . . . . 10 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → (Fun ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴) ↔ Fun 𝑔))
7143, 70mpbird 247 . . . . . . . . 9 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → Fun ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
72 vex 3203 . . . . . . . . . . 11 𝑔 ∈ V
73 nnex 11026 . . . . . . . . . . . . 13 ℕ ∈ V
74 difexg 4808 . . . . . . . . . . . . 13 (ℕ ∈ V → (ℕ ∖ (1...(#‘𝐴))) ∈ V)
7573, 74ax-mp 5 . . . . . . . . . . . 12 (ℕ ∖ (1...(#‘𝐴))) ∈ V
7675mptex 6486 . . . . . . . . . . 11 (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍) ∈ V
7772, 76unex 6956 . . . . . . . . . 10 (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ∈ V
78 feq1 6026 . . . . . . . . . . 11 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ↔ (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍})))
79 rneq 5351 . . . . . . . . . . . 12 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → ran 𝑓 = ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
8079sseq2d 3633 . . . . . . . . . . 11 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → (𝐴 ⊆ ran 𝑓𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍))))
81 cnveq 5296 . . . . . . . . . . . . 13 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → 𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)))
82 eqidd 2623 . . . . . . . . . . . . 13 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → 𝐴 = 𝐴)
8381, 82reseq12d 5397 . . . . . . . . . . . 12 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → (𝑓𝐴) = ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴))
8483funeqd 5910 . . . . . . . . . . 11 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → (Fun (𝑓𝐴) ↔ Fun ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴)))
8578, 80, 843anbi123d 1399 . . . . . . . . . 10 (𝑓 = (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) → ((𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)) ↔ ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ∧ Fun ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴))))
8677, 85spcev 3300 . . . . . . . . 9 (((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)):ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran (𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ∧ Fun ((𝑔 ∪ (𝑥 ∈ (ℕ ∖ (1...(#‘𝐴))) ↦ 𝑍)) ↾ 𝐴)) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
8728, 40, 71, 86syl3anc 1326 . . . . . . . 8 (((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) ∧ 𝑔:(1...(#‘𝐴))–1-1-onto𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
8887ex 450 . . . . . . 7 ((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → (𝑔:(1...(#‘𝐴))–1-1-onto𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
899, 10, 88exlimd 2087 . . . . . 6 ((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → (∃𝑔 𝑔:(1...(#‘𝐴))–1-1-onto𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
908, 89mpd 15 . . . . 5 ((𝐴 ≺ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
91903expia 1267 . . . 4 ((𝐴 ≺ ω ∧ 𝑍𝑉) → (¬ 𝑍𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
92 nnenom 12779 . . . . . . . 8 ℕ ≈ ω
93 simpl 473 . . . . . . . . 9 ((𝐴 ≈ ω ∧ 𝑍𝑉) → 𝐴 ≈ ω)
9493ensymd 8007 . . . . . . . 8 ((𝐴 ≈ ω ∧ 𝑍𝑉) → ω ≈ 𝐴)
95 entr 8008 . . . . . . . 8 ((ℕ ≈ ω ∧ ω ≈ 𝐴) → ℕ ≈ 𝐴)
9692, 94, 95sylancr 695 . . . . . . 7 ((𝐴 ≈ ω ∧ 𝑍𝑉) → ℕ ≈ 𝐴)
97 bren 7964 . . . . . . 7 (ℕ ≈ 𝐴 ↔ ∃𝑓 𝑓:ℕ–1-1-onto𝐴)
9896, 97sylib 208 . . . . . 6 ((𝐴 ≈ ω ∧ 𝑍𝑉) → ∃𝑓 𝑓:ℕ–1-1-onto𝐴)
99 nfv 1843 . . . . . . 7 𝑓(𝐴 ≈ ω ∧ 𝑍𝑉)
100 simpr 477 . . . . . . . . . 10 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → 𝑓:ℕ–1-1-onto𝐴)
101 f1of 6137 . . . . . . . . . 10 (𝑓:ℕ–1-1-onto𝐴𝑓:ℕ⟶𝐴)
102 ssun1 3776 . . . . . . . . . . 11 𝐴 ⊆ (𝐴 ∪ {𝑍})
103 fss 6056 . . . . . . . . . . 11 ((𝑓:ℕ⟶𝐴𝐴 ⊆ (𝐴 ∪ {𝑍})) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
104102, 103mpan2 707 . . . . . . . . . 10 (𝑓:ℕ⟶𝐴𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
105100, 101, 1043syl 18 . . . . . . . . 9 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → 𝑓:ℕ⟶(𝐴 ∪ {𝑍}))
106 f1ofo 6144 . . . . . . . . . . 11 (𝑓:ℕ–1-1-onto𝐴𝑓:ℕ–onto𝐴)
107 forn 6118 . . . . . . . . . . 11 (𝑓:ℕ–onto𝐴 → ran 𝑓 = 𝐴)
108100, 106, 1073syl 18 . . . . . . . . . 10 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → ran 𝑓 = 𝐴)
10929, 108syl5sseqr 3654 . . . . . . . . 9 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → 𝐴 ⊆ ran 𝑓)
110 f1ocnv 6149 . . . . . . . . . . 11 (𝑓:ℕ–1-1-onto𝐴𝑓:𝐴1-1-onto→ℕ)
111 f1of1 6136 . . . . . . . . . . 11 (𝑓:𝐴1-1-onto→ℕ → 𝑓:𝐴1-1→ℕ)
112100, 110, 1113syl 18 . . . . . . . . . 10 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → 𝑓:𝐴1-1→ℕ)
113 f1ores 6151 . . . . . . . . . . 11 ((𝑓:𝐴1-1→ℕ ∧ 𝐴𝐴) → (𝑓𝐴):𝐴1-1-onto→(𝑓𝐴))
11429, 113mpan2 707 . . . . . . . . . 10 (𝑓:𝐴1-1→ℕ → (𝑓𝐴):𝐴1-1-onto→(𝑓𝐴))
115 f1ofun 6139 . . . . . . . . . 10 ((𝑓𝐴):𝐴1-1-onto→(𝑓𝐴) → Fun (𝑓𝐴))
116112, 114, 1153syl 18 . . . . . . . . 9 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → Fun (𝑓𝐴))
117105, 109, 1163jca 1242 . . . . . . . 8 (((𝐴 ≈ ω ∧ 𝑍𝑉) ∧ 𝑓:ℕ–1-1-onto𝐴) → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
118117ex 450 . . . . . . 7 ((𝐴 ≈ ω ∧ 𝑍𝑉) → (𝑓:ℕ–1-1-onto𝐴 → (𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
11999, 118eximd 2085 . . . . . 6 ((𝐴 ≈ ω ∧ 𝑍𝑉) → (∃𝑓 𝑓:ℕ–1-1-onto𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
12098, 119mpd 15 . . . . 5 ((𝐴 ≈ ω ∧ 𝑍𝑉) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
121120a1d 25 . . . 4 ((𝐴 ≈ ω ∧ 𝑍𝑉) → (¬ 𝑍𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
12291, 121jaoian 824 . . 3 (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍𝑉) → (¬ 𝑍𝐴 → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴))))
1231223impia 1261 . 2 (((𝐴 ≺ ω ∨ 𝐴 ≈ ω) ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
1241, 123syl3an1b 1362 1 ((𝐴 ≼ ω ∧ 𝑍𝑉 ∧ ¬ 𝑍𝐴) → ∃𝑓(𝑓:ℕ⟶(𝐴 ∪ {𝑍}) ∧ 𝐴 ⊆ ran 𝑓 ∧ Fun (𝑓𝐴)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wo 383  wa 384  w3a 1037   = wceq 1483  wex 1704  wcel 1990  Vcvv 3200  cdif 3571  cun 3572  cin 3573  wss 3574  c0 3915  {csn 4177   class class class wbr 4653  cmpt 4729   × cxp 5112  ccnv 5113  ran crn 5115  cres 5116  cima 5117  Fun wfun 5882   Fn wfn 5883  wf 5884  1-1wf1 5885  ontowfo 5886  1-1-ontowf1o 5887  cfv 5888  (class class class)co 6650  ωcom 7065  cen 7952  cdom 7953  csdm 7954  Fincfn 7955  1c1 9937  cn 11020  ...cfz 12326  #chash 13117
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-n0 11293  df-z 11378  df-uz 11688  df-fz 12327  df-hash 13118
This theorem is referenced by:  carsggect  30380
  Copyright terms: Public domain W3C validator