Theorem ackbij1lem14 10349

Description: Lemma for ackbij1 10354. (Contributed by Stefan O'Rear, 18-Nov-2014.)

Hypothesis

Ref	Expression
ackbij.f	⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))

Assertion

Ref	Expression
ackbij1lem14	⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = suc (𝐹‘𝐴))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐴,𝑦

Proof of Theorem ackbij1lem14

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ackbij.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
2	1	ackbij1lem8 10343	. 2 ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴))
3		pweq 4574	. . . . 5 ⊢ (𝑎 = ∅ → 𝒫 𝑎 = 𝒫 ∅)
4	3	fveq2d 6920	. . . 4 ⊢ (𝑎 = ∅ → (card‘𝒫 𝑎) = (card‘𝒫 ∅))
5		fveq2 6916	. . . . 5 ⊢ (𝑎 = ∅ → (𝐹‘𝑎) = (𝐹‘∅))
6		suceq 6457	. . . . 5 ⊢ ((𝐹‘𝑎) = (𝐹‘∅) → suc (𝐹‘𝑎) = suc (𝐹‘∅))
7	5, 6	syl 18	. . . 4 ⊢ (𝑎 = ∅ → suc (𝐹‘𝑎) = suc (𝐹‘∅))
8	4, 7	eqeq12d 2779	. . 3 ⊢ (𝑎 = ∅ → ((card‘𝒫 𝑎) = suc (𝐹‘𝑎) ↔ (card‘𝒫 ∅) = suc (𝐹‘∅)))
9		pweq 4574	. . . . 5 ⊢ (𝑎 = 𝑏 → 𝒫 𝑎 = 𝒫 𝑏)
10	9	fveq2d 6920	. . . 4 ⊢ (𝑎 = 𝑏 → (card‘𝒫 𝑎) = (card‘𝒫 𝑏))
11		fveq2 6916	. . . . 5 ⊢ (𝑎 = 𝑏 → (𝐹‘𝑎) = (𝐹‘𝑏))
12		suceq 6457	. . . . 5 ⊢ ((𝐹‘𝑎) = (𝐹‘𝑏) → suc (𝐹‘𝑎) = suc (𝐹‘𝑏))
13	11, 12	syl 18	. . . 4 ⊢ (𝑎 = 𝑏 → suc (𝐹‘𝑎) = suc (𝐹‘𝑏))
14	10, 13	eqeq12d 2779	. . 3 ⊢ (𝑎 = 𝑏 → ((card‘𝒫 𝑎) = suc (𝐹‘𝑎) ↔ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)))
15		pweq 4574	. . . . 5 ⊢ (𝑎 = suc 𝑏 → 𝒫 𝑎 = 𝒫 suc 𝑏)
16	15	fveq2d 6920	. . . 4 ⊢ (𝑎 = suc 𝑏 → (card‘𝒫 𝑎) = (card‘𝒫 suc 𝑏))
17		fveq2 6916	. . . . 5 ⊢ (𝑎 = suc 𝑏 → (𝐹‘𝑎) = (𝐹‘suc 𝑏))
18		suceq 6457	. . . . 5 ⊢ ((𝐹‘𝑎) = (𝐹‘suc 𝑏) → suc (𝐹‘𝑎) = suc (𝐹‘suc 𝑏))
19	17, 18	syl 18	. . . 4 ⊢ (𝑎 = suc 𝑏 → suc (𝐹‘𝑎) = suc (𝐹‘suc 𝑏))
20	16, 19	eqeq12d 2779	. . 3 ⊢ (𝑎 = suc 𝑏 → ((card‘𝒫 𝑎) = suc (𝐹‘𝑎) ↔ (card‘𝒫 suc 𝑏) = suc (𝐹‘suc 𝑏)))
21		pweq 4574	. . . . 5 ⊢ (𝑎 = 𝐴 → 𝒫 𝑎 = 𝒫 𝐴)
22	21	fveq2d 6920	. . . 4 ⊢ (𝑎 = 𝐴 → (card‘𝒫 𝑎) = (card‘𝒫 𝐴))
23		fveq2 6916	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝐹‘𝑎) = (𝐹‘𝐴))
24		suceq 6457	. . . . 5 ⊢ ((𝐹‘𝑎) = (𝐹‘𝐴) → suc (𝐹‘𝑎) = suc (𝐹‘𝐴))
25	23, 24	syl 18	. . . 4 ⊢ (𝑎 = 𝐴 → suc (𝐹‘𝑎) = suc (𝐹‘𝐴))
26	22, 25	eqeq12d 2779	. . 3 ⊢ (𝑎 = 𝐴 → ((card‘𝒫 𝑎) = suc (𝐹‘𝑎) ↔ (card‘𝒫 𝐴) = suc (𝐹‘𝐴)))
27		df-1o 8514	. . . 4 ⊢ 1o = suc ∅
28		pw0 4835	. . . . . 6 ⊢ 𝒫 ∅ = {∅}
29	28	fveq2i 6919	. . . . 5 ⊢ (card‘𝒫 ∅) = (card‘{∅})
30		0ex 5267	. . . . . 6 ⊢ ∅ ∈ V
31		cardsn 10087	. . . . . 6 ⊢ (∅ ∈ V → (card‘{∅}) = 1o)
32	30, 31	ax-mp 5	. . . . 5 ⊢ (card‘{∅}) = 1o
33	29, 32	eqtri 2786	. . . 4 ⊢ (card‘𝒫 ∅) = 1o
34	1	ackbij1lem13 10348	. . . . 5 ⊢ (𝐹‘∅) = ∅
35		suceq 6457	. . . . 5 ⊢ ((𝐹‘∅) = ∅ → suc (𝐹‘∅) = suc ∅)
36	34, 35	ax-mp 5	. . . 4 ⊢ suc (𝐹‘∅) = suc ∅
37	27, 33, 36	3eqtr4i 2796	. . 3 ⊢ (card‘𝒫 ∅) = suc (𝐹‘∅)
38		oveq2 7459	. . . . . 6 ⊢ ((card‘𝒫 𝑏) = suc (𝐹‘𝑏) → ((card‘𝒫 𝑏) +o (card‘𝒫 𝑏)) = ((card‘𝒫 𝑏) +o suc (𝐹‘𝑏)))
39	38	adantl 487	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → ((card‘𝒫 𝑏) +o (card‘𝒫 𝑏)) = ((card‘𝒫 𝑏) +o suc (𝐹‘𝑏)))
40		ackbij1lem5 10340	. . . . . 6 ⊢ (𝑏 ∈ ω → (card‘𝒫 suc 𝑏) = ((card‘𝒫 𝑏) +o (card‘𝒫 𝑏)))
41	40	adantr 486	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (card‘𝒫 suc 𝑏) = ((card‘𝒫 𝑏) +o (card‘𝒫 𝑏)))
42		df-suc 6394	. . . . . . . . . 10 ⊢ suc 𝑏 = (𝑏 ∪ {𝑏})
43	42	equncomi 4162	. . . . . . . . 9 ⊢ suc 𝑏 = ({𝑏} ∪ 𝑏)
44	43	fveq2i 6919	. . . . . . . 8 ⊢ (𝐹‘suc 𝑏) = (𝐹‘({𝑏} ∪ 𝑏))
45		ackbij1lem4 10339	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → {𝑏} ∈ (𝒫 ω ∩ Fin))
46	45	adantr 486	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → {𝑏} ∈ (𝒫 ω ∩ Fin))
47		ackbij1lem3 10338	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → 𝑏 ∈ (𝒫 ω ∩ Fin))
48	47	adantr 486	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → 𝑏 ∈ (𝒫 ω ∩ Fin))
49		incom 4109	. . . . . . . . . . . 12 ⊢ ({𝑏} ∩ 𝑏) = (𝑏 ∩ {𝑏})
50		nnord 7919	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ ω → Ord 𝑏)
51		orddisj 6427	. . . . . . . . . . . . 13 ⊢ (Ord 𝑏 → (𝑏 ∩ {𝑏}) = ∅)
52	50, 51	syl 18	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ ω → (𝑏 ∩ {𝑏}) = ∅)
53	49, 52	eqtrid 2810	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → ({𝑏} ∩ 𝑏) = ∅)
54	53	adantr 486	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → ({𝑏} ∩ 𝑏) = ∅)
55	1	ackbij1lem9 10344	. . . . . . . . . 10 ⊢ (({𝑏} ∈ (𝒫 ω ∩ Fin) ∧ 𝑏 ∈ (𝒫 ω ∩ Fin) ∧ ({𝑏} ∩ 𝑏) = ∅) → (𝐹‘({𝑏} ∪ 𝑏)) = ((𝐹‘{𝑏}) +o (𝐹‘𝑏)))
56	46, 48, 54, 55	syl3anc 1399	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (𝐹‘({𝑏} ∪ 𝑏)) = ((𝐹‘{𝑏}) +o (𝐹‘𝑏)))
57	1	ackbij1lem8 10343	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → (𝐹‘{𝑏}) = (card‘𝒫 𝑏))
58	57	adantr 486	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (𝐹‘{𝑏}) = (card‘𝒫 𝑏))
59	58	oveq1d 7466	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → ((𝐹‘{𝑏}) +o (𝐹‘𝑏)) = ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
60	56, 59	eqtrd 2798	. . . . . . . 8 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (𝐹‘({𝑏} ∪ 𝑏)) = ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
61	44, 60	eqtrid 2810	. . . . . . 7 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (𝐹‘suc 𝑏) = ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
62		suceq 6457	. . . . . . 7 ⊢ ((𝐹‘suc 𝑏) = ((card‘𝒫 𝑏) +o (𝐹‘𝑏)) → suc (𝐹‘suc 𝑏) = suc ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
63	61, 62	syl 18	. . . . . 6 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → suc (𝐹‘suc 𝑏) = suc ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
64		nnfi 9221	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → 𝑏 ∈ Fin)
65		pwfi 9348	. . . . . . . . . 10 ⊢ (𝑏 ∈ Fin ↔ 𝒫 𝑏 ∈ Fin)
66	64, 65	sylib 221	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → 𝒫 𝑏 ∈ Fin)
67	66	adantr 486	. . . . . . . 8 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → 𝒫 𝑏 ∈ Fin)
68		ficardom 10079	. . . . . . . 8 ⊢ (𝒫 𝑏 ∈ Fin → (card‘𝒫 𝑏) ∈ ω)
69	67, 68	syl 18	. . . . . . 7 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (card‘𝒫 𝑏) ∈ ω)
70	1	ackbij1lem10 10345	. . . . . . . . 9 ⊢ 𝐹:(𝒫 ω ∩ Fin)⟶ω
71	70	ffvelcdmi 7115	. . . . . . . 8 ⊢ (𝑏 ∈ (𝒫 ω ∩ Fin) → (𝐹‘𝑏) ∈ ω)
72	48, 71	syl 18	. . . . . . 7 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (𝐹‘𝑏) ∈ ω)
73		nnasuc 8653	. . . . . . 7 ⊢ (((card‘𝒫 𝑏) ∈ ω ∧ (𝐹‘𝑏) ∈ ω) → ((card‘𝒫 𝑏) +o suc (𝐹‘𝑏)) = suc ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
74	69, 72, 73	syl2anc 596	. . . . . 6 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → ((card‘𝒫 𝑏) +o suc (𝐹‘𝑏)) = suc ((card‘𝒫 𝑏) +o (𝐹‘𝑏)))
75	63, 74	eqtr4d 2801	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → suc (𝐹‘suc 𝑏) = ((card‘𝒫 𝑏) +o suc (𝐹‘𝑏)))
76	39, 41, 75	3eqtr4d 2808	. . . 4 ⊢ ((𝑏 ∈ ω ∧ (card‘𝒫 𝑏) = suc (𝐹‘𝑏)) → (card‘𝒫 suc 𝑏) = suc (𝐹‘suc 𝑏))
77	76	ex 418	. . 3 ⊢ (𝑏 ∈ ω → ((card‘𝒫 𝑏) = suc (𝐹‘𝑏) → (card‘𝒫 suc 𝑏) = suc (𝐹‘suc 𝑏)))
78	8, 14, 20, 26, 37, 77	finds 7942	. 2 ⊢ (𝐴 ∈ ω → (card‘𝒫 𝐴) = suc (𝐹‘𝐴))
79	2, 78	eqtrd 2798	1 ⊢ (𝐴 ∈ ω → (𝐹‘{𝐴}) = suc (𝐹‘𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ∪ ciun 4956   ↦ cmpt 5192   × cxp 5656  Ord word 6387  suc csuc 6390  ‘cfv 6566  (class class class)co 7451  ωcom 7911  1_oc1o 8507   +_o coa 8511  Fincfn 9011  cardccrd 10053

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057

This theorem is used by:  ackbij1lem15  10350  ackbij1lem18  10353  ackbij1b  10355