ackbij2lem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ackbij2lem2		Structured version Visualization version GIF version

Theorem ackbij2lem2 10149

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

**Hypotheses**
Ref	Expression
ackbij.f	⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
ackbij.g	⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑦 ∈ 𝒫 dom 𝑥 ↦ (𝐹‘(𝑥 “ 𝑦))))

**Assertion**
Ref	Expression
ackbij2lem2	⊢ (𝐴 ∈ ω → (rec(𝐺, ∅)‘𝐴):(𝑅₁‘𝐴)–1-1-onto→(card‘(𝑅₁‘𝐴)))

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

Proof of Theorem ackbij2lem2 Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6834	. . 3 ⊢ (𝑎 = ∅ → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘∅))
2		fveq2 6834	. . 3 ⊢ (𝑎 = ∅ → (𝑅₁‘𝑎) = (𝑅₁‘∅))
3		2fveq3 6839	. . 3 ⊢ (𝑎 = ∅ → (card‘(𝑅₁‘𝑎)) = (card‘(𝑅₁‘∅)))
4	1, 2, 3	f1oeq123d 6768	. 2 ⊢ (𝑎 = ∅ → ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)) ↔ (rec(𝐺, ∅)‘∅):(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅))))
5		fveq2 6834	. . 3 ⊢ (𝑎 = 𝑏 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘𝑏))
6		fveq2 6834	. . 3 ⊢ (𝑎 = 𝑏 → (𝑅₁‘𝑎) = (𝑅₁‘𝑏))
7		2fveq3 6839	. . 3 ⊢ (𝑎 = 𝑏 → (card‘(𝑅₁‘𝑎)) = (card‘(𝑅₁‘𝑏)))
8	5, 6, 7	f1oeq123d 6768	. 2 ⊢ (𝑎 = 𝑏 → ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)) ↔ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))))
9		fveq2 6834	. . 3 ⊢ (𝑎 = suc 𝑏 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘suc 𝑏))
10		fveq2 6834	. . 3 ⊢ (𝑎 = suc 𝑏 → (𝑅₁‘𝑎) = (𝑅₁‘suc 𝑏))
11		2fveq3 6839	. . 3 ⊢ (𝑎 = suc 𝑏 → (card‘(𝑅₁‘𝑎)) = (card‘(𝑅₁‘suc 𝑏)))
12	9, 10, 11	f1oeq123d 6768	. 2 ⊢ (𝑎 = suc 𝑏 → ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)) ↔ (rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏))))
13		fveq2 6834	. . 3 ⊢ (𝑎 = 𝐴 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘𝐴))
14		fveq2 6834	. . 3 ⊢ (𝑎 = 𝐴 → (𝑅₁‘𝑎) = (𝑅₁‘𝐴))
15		2fveq3 6839	. . 3 ⊢ (𝑎 = 𝐴 → (card‘(𝑅₁‘𝑎)) = (card‘(𝑅₁‘𝐴)))
16	13, 14, 15	f1oeq123d 6768	. 2 ⊢ (𝑎 = 𝐴 → ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)) ↔ (rec(𝐺, ∅)‘𝐴):(𝑅₁‘𝐴)–1-1-onto→(card‘(𝑅₁‘𝐴))))
17		f1o0 6811	. . 3 ⊢ ∅:∅–1-1-onto→∅
18		0ex 5252	. . . . . 6 ⊢ ∅ ∈ V
19	18	rdg0 8352	. . . . 5 ⊢ (rec(𝐺, ∅)‘∅) = ∅
20		f1oeq1 6762	. . . . 5 ⊢ ((rec(𝐺, ∅)‘∅) = ∅ → ((rec(𝐺, ∅)‘∅):(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)) ↔ ∅:(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅))))
21	19, 20	ax-mp 5	. . . 4 ⊢ ((rec(𝐺, ∅)‘∅):(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)) ↔ ∅:(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)))
22		r10 9680	. . . . 5 ⊢ (𝑅₁‘∅) = ∅
23	22	fveq2i 6837	. . . . . 6 ⊢ (card‘(𝑅₁‘∅)) = (card‘∅)
24		card0 9870	. . . . . 6 ⊢ (card‘∅) = ∅
25	23, 24	eqtri 2759	. . . . 5 ⊢ (card‘(𝑅₁‘∅)) = ∅
26		f1oeq23 6765	. . . . 5 ⊢ (((𝑅₁‘∅) = ∅ ∧ (card‘(𝑅₁‘∅)) = ∅) → (∅:(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)) ↔ ∅:∅–1-1-onto→∅))
27	22, 25, 26	mp2an 692	. . . 4 ⊢ (∅:(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)) ↔ ∅:∅–1-1-onto→∅)
28	21, 27	bitri 275	. . 3 ⊢ ((rec(𝐺, ∅)‘∅):(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅)) ↔ ∅:∅–1-1-onto→∅)
29	17, 28	mpbir 231	. 2 ⊢ (rec(𝐺, ∅)‘∅):(𝑅₁‘∅)–1-1-onto→(card‘(𝑅₁‘∅))
30		ackbij.f	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
31	30	ackbij1lem17 10145	. . . . . . . . 9 ⊢ 𝐹:(𝒫 ω ∩ Fin)–1-1→ω
32	31	a1i 11	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝐹:(𝒫 ω ∩ Fin)–1-1→ω)
33		r1fin 9685	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → (𝑅₁‘𝑏) ∈ Fin)
34		ficardom 9873	. . . . . . . . . 10 ⊢ ((𝑅₁‘𝑏) ∈ Fin → (card‘(𝑅₁‘𝑏)) ∈ ω)
35	33, 34	syl 17	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → (card‘(𝑅₁‘𝑏)) ∈ ω)
36		ackbij2lem1 10128	. . . . . . . . 9 ⊢ ((card‘(𝑅₁‘𝑏)) ∈ ω → 𝒫 (card‘(𝑅₁‘𝑏)) ⊆ (𝒫 ω ∩ Fin))
37	35, 36	syl 17	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝒫 (card‘(𝑅₁‘𝑏)) ⊆ (𝒫 ω ∩ Fin))
38		f1ores 6788	. . . . . . . 8 ⊢ ((𝐹:(𝒫 ω ∩ Fin)–1-1→ω ∧ 𝒫 (card‘(𝑅₁‘𝑏)) ⊆ (𝒫 ω ∩ Fin)) → (𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))))
39	32, 37, 38	syl2anc 584	. . . . . . 7 ⊢ (𝑏 ∈ ω → (𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))))
40	30	ackbij1b 10148	. . . . . . . . . 10 ⊢ ((card‘(𝑅₁‘𝑏)) ∈ ω → (𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))) = (card‘𝒫 (card‘(𝑅₁‘𝑏))))
41	35, 40	syl 17	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → (𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))) = (card‘𝒫 (card‘(𝑅₁‘𝑏))))
42		ficardid 9874	. . . . . . . . . 10 ⊢ ((𝑅₁‘𝑏) ∈ Fin → (card‘(𝑅₁‘𝑏)) ≈ (𝑅₁‘𝑏))
43		pwen 9078	. . . . . . . . . 10 ⊢ ((card‘(𝑅₁‘𝑏)) ≈ (𝑅₁‘𝑏) → 𝒫 (card‘(𝑅₁‘𝑏)) ≈ 𝒫 (𝑅₁‘𝑏))
44		carden2b 9879	. . . . . . . . . 10 ⊢ (𝒫 (card‘(𝑅₁‘𝑏)) ≈ 𝒫 (𝑅₁‘𝑏) → (card‘𝒫 (card‘(𝑅₁‘𝑏))) = (card‘𝒫 (𝑅₁‘𝑏)))
45	33, 42, 43, 44	4syl 19	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → (card‘𝒫 (card‘(𝑅₁‘𝑏))) = (card‘𝒫 (𝑅₁‘𝑏)))
46	41, 45	eqtrd 2771	. . . . . . . 8 ⊢ (𝑏 ∈ ω → (𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))) = (card‘𝒫 (𝑅₁‘𝑏)))
47	46	f1oeq3d 6771	. . . . . . 7 ⊢ (𝑏 ∈ ω → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(𝐹 “ 𝒫 (card‘(𝑅₁‘𝑏))) ↔ (𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏))))
48	39, 47	mpbid 232	. . . . . 6 ⊢ (𝑏 ∈ ω → (𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)))
49	48	adantr 480	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)))
50		f1opw 7614	. . . . . 6 ⊢ ((rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏)) → (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)–1-1-onto→𝒫 (card‘(𝑅₁‘𝑏)))
51	50	adantl 481	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)–1-1-onto→𝒫 (card‘(𝑅₁‘𝑏)))
52		f1oco 6797	. . . . 5 ⊢ (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))):𝒫 (card‘(𝑅₁‘𝑏))–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)) ∧ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)–1-1-onto→𝒫 (card‘(𝑅₁‘𝑏))) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)))
53	49, 51, 52	syl2anc 584	. . . 4 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)))
54		frsuc 8368	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → ((rec(𝐺, ∅) ↾ ω)‘suc 𝑏) = (𝐺‘((rec(𝐺, ∅) ↾ ω)‘𝑏)))
55		peano2 7832	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → suc 𝑏 ∈ ω)
56	55	fvresd 6854	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → ((rec(𝐺, ∅) ↾ ω)‘suc 𝑏) = (rec(𝐺, ∅)‘suc 𝑏))
57		fvres 6853	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω → ((rec(𝐺, ∅) ↾ ω)‘𝑏) = (rec(𝐺, ∅)‘𝑏))
58	57	fveq2d 6838	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → (𝐺‘((rec(𝐺, ∅) ↾ ω)‘𝑏)) = (𝐺‘(rec(𝐺, ∅)‘𝑏)))
59		fvex 6847	. . . . . . . . . . 11 ⊢ (rec(𝐺, ∅)‘𝑏) ∈ V
60		dmeq 5852	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (rec(𝐺, ∅)‘𝑏) → dom 𝑥 = dom (rec(𝐺, ∅)‘𝑏))
61	60	pweqd 4571	. . . . . . . . . . . . 13 ⊢ (𝑥 = (rec(𝐺, ∅)‘𝑏) → 𝒫 dom 𝑥 = 𝒫 dom (rec(𝐺, ∅)‘𝑏))
62		imaeq1 6014	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (rec(𝐺, ∅)‘𝑏) → (𝑥 “ 𝑦) = ((rec(𝐺, ∅)‘𝑏) “ 𝑦))
63	62	fveq2d 6838	. . . . . . . . . . . . 13 ⊢ (𝑥 = (rec(𝐺, ∅)‘𝑏) → (𝐹‘(𝑥 “ 𝑦)) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))
64	61, 63	mpteq12dv 5185	. . . . . . . . . . . 12 ⊢ (𝑥 = (rec(𝐺, ∅)‘𝑏) → (𝑦 ∈ 𝒫 dom 𝑥 ↦ (𝐹‘(𝑥 “ 𝑦))) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
65		ackbij.g	. . . . . . . . . . . 12 ⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑦 ∈ 𝒫 dom 𝑥 ↦ (𝐹‘(𝑥 “ 𝑦))))
66	59	dmex 7851	. . . . . . . . . . . . . 14 ⊢ dom (rec(𝐺, ∅)‘𝑏) ∈ V
67	66	pwex 5325	. . . . . . . . . . . . 13 ⊢ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ∈ V
68	67	mptex 7169	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) ∈ V
69	64, 65, 68	fvmpt 6941	. . . . . . . . . . 11 ⊢ ((rec(𝐺, ∅)‘𝑏) ∈ V → (𝐺‘(rec(𝐺, ∅)‘𝑏)) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
70	59, 69	ax-mp 5	. . . . . . . . . 10 ⊢ (𝐺‘(rec(𝐺, ∅)‘𝑏)) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))
71	58, 70	eqtrdi 2787	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → (𝐺‘((rec(𝐺, ∅) ↾ ω)‘𝑏)) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
72	54, 56, 71	3eqtr3d 2779	. . . . . . . 8 ⊢ (𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
73	72	adantr 480	. . . . . . 7 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (rec(𝐺, ∅)‘suc 𝑏) = (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
74		f1odm 6778	. . . . . . . . . . 11 ⊢ ((rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏)) → dom (rec(𝐺, ∅)‘𝑏) = (𝑅₁‘𝑏))
75	74	adantl 481	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → dom (rec(𝐺, ∅)‘𝑏) = (𝑅₁‘𝑏))
76	75	pweqd 4571	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → 𝒫 dom (rec(𝐺, ∅)‘𝑏) = 𝒫 (𝑅₁‘𝑏))
77	76	mpteq1d 5188	. . . . . . . 8 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) = (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))))
78		fvex 6847	. . . . . . . . . . 11 ⊢ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)) ∈ V
79		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) = (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))
80	78, 79	fnmpti 6635	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) Fn 𝒫 (𝑅₁‘𝑏)
81	80	a1i 11	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) Fn 𝒫 (𝑅₁‘𝑏))
82		f1ofn 6775	. . . . . . . . . 10 ⊢ (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏)) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))) Fn 𝒫 (𝑅₁‘𝑏))
83	53, 82	syl 17	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))) Fn 𝒫 (𝑅₁‘𝑏))
84		f1of 6774	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)–1-1-onto→𝒫 (card‘(𝑅₁‘𝑏)) → (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)⟶𝒫 (card‘(𝑅₁‘𝑏)))
85	51, 84	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)⟶𝒫 (card‘(𝑅₁‘𝑏)))
86	85	ffvelcdmda 7029	. . . . . . . . . . . 12 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐) ∈ 𝒫 (card‘(𝑅₁‘𝑏)))
87	86	fvresd 6854	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏)))‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)) = (𝐹‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)))
88		imaeq2 6015	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑐 → ((rec(𝐺, ∅)‘𝑏) “ 𝑎) = ((rec(𝐺, ∅)‘𝑏) “ 𝑐))
89		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)) = (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))
90	59	imaex 7856	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑏) “ 𝑐) ∈ V
91	88, 89, 90	fvmpt 6941	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ 𝒫 (𝑅₁‘𝑏) → ((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐) = ((rec(𝐺, ∅)‘𝑏) “ 𝑐))
92	91	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐) = ((rec(𝐺, ∅)‘𝑏) “ 𝑐))
93	92	fveq2d 6838	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → (𝐹‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)))
94	87, 93	eqtrd 2771	. . . . . . . . . 10 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏)))‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)))
95		fvco3 6933	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)):𝒫 (𝑅₁‘𝑏)⟶𝒫 (card‘(𝑅₁‘𝑏)) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)))‘𝑐) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏)))‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)))
96	85, 95	sylan 580	. . . . . . . . . 10 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)))‘𝑐) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏)))‘((𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))‘𝑐)))
97		imaeq2 6015	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑐 → ((rec(𝐺, ∅)‘𝑏) “ 𝑦) = ((rec(𝐺, ∅)‘𝑏) “ 𝑐))
98	97	fveq2d 6838	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑐 → (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)))
99		fvex 6847	. . . . . . . . . . . 12 ⊢ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)) ∈ V
100	98, 79, 99	fvmpt 6941	. . . . . . . . . . 11 ⊢ (𝑐 ∈ 𝒫 (𝑅₁‘𝑏) → ((𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))‘𝑐) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)))
101	100	adantl 481	. . . . . . . . . 10 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))‘𝑐) = (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑐)))
102	94, 96, 101	3eqtr4rd 2782	. . . . . . . . 9 ⊢ (((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) ∧ 𝑐 ∈ 𝒫 (𝑅₁‘𝑏)) → ((𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦)))‘𝑐) = (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎)))‘𝑐))
103	81, 83, 102	eqfnfvd 6979	. . . . . . . 8 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑦 ∈ 𝒫 (𝑅₁‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))))
104	77, 103	eqtrd 2771	. . . . . . 7 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (𝑦 ∈ 𝒫 dom (rec(𝐺, ∅)‘𝑏) ↦ (𝐹‘((rec(𝐺, ∅)‘𝑏) “ 𝑦))) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))))
105	73, 104	eqtrd 2771	. . . . . 6 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (rec(𝐺, ∅)‘suc 𝑏) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))))
106		f1oeq1 6762	. . . . . 6 ⊢ ((rec(𝐺, ∅)‘suc 𝑏) = ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))) → ((rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏))))
107	105, 106	syl 17	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → ((rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏))))
108		nnon 7814	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝑏 ∈ On)
109		r1suc 9682	. . . . . . . 8 ⊢ (𝑏 ∈ On → (𝑅₁‘suc 𝑏) = 𝒫 (𝑅₁‘𝑏))
110	108, 109	syl 17	. . . . . . 7 ⊢ (𝑏 ∈ ω → (𝑅₁‘suc 𝑏) = 𝒫 (𝑅₁‘𝑏))
111	110	fveq2d 6838	. . . . . . 7 ⊢ (𝑏 ∈ ω → (card‘(𝑅₁‘suc 𝑏)) = (card‘𝒫 (𝑅₁‘𝑏)))
112		f1oeq23 6765	. . . . . . 7 ⊢ (((𝑅₁‘suc 𝑏) = 𝒫 (𝑅₁‘𝑏) ∧ (card‘(𝑅₁‘suc 𝑏)) = (card‘𝒫 (𝑅₁‘𝑏))) → (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏))))
113	110, 111, 112	syl2anc 584	. . . . . 6 ⊢ (𝑏 ∈ ω → (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏))))
114	113	adantr 480	. . . . 5 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏))))
115	107, 114	bitrd 279	. . . 4 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → ((rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) ↔ ((𝐹 ↾ 𝒫 (card‘(𝑅₁‘𝑏))) ∘ (𝑎 ∈ 𝒫 (𝑅₁‘𝑏) ↦ ((rec(𝐺, ∅)‘𝑏) “ 𝑎))):𝒫 (𝑅₁‘𝑏)–1-1-onto→(card‘𝒫 (𝑅₁‘𝑏))))
116	53, 115	mpbird 257	. . 3 ⊢ ((𝑏 ∈ ω ∧ (rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏))) → (rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)))
117	116	ex 412	. 2 ⊢ (𝑏 ∈ ω → ((rec(𝐺, ∅)‘𝑏):(𝑅₁‘𝑏)–1-1-onto→(card‘(𝑅₁‘𝑏)) → (rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏))))
118	4, 8, 12, 16, 29, 117	finds 7838	1 ⊢ (𝐴 ∈ ω → (rec(𝐺, ∅)‘𝐴):(𝑅₁‘𝐴)–1-1-onto→(card‘(𝑅₁‘𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3440 ∩ cin 3900 ⊆ wss 3901 ∅c0 4285 𝒫 cpw 4554 {csn 4580 ∪ ciun 4946 class class class wbr 5098 ↦ cmpt 5179 × cxp 5622 dom cdm 5624 ↾ cres 5626 “ cima 5627 ∘ ccom 5628 Oncon0 6317 suc csuc 6319 Fn wfn 6487 ⟶wf 6488 –1-1→wf1 6489 –1-1-onto→wf1o 6491 ‘cfv 6492 ωcom 7808 reccrdg 8340 ≈ cen 8880 Fincfn 8883 𝑅₁cr1 9674 cardccrd 9847

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-r1 9676 df-dju 9813 df-card 9851

This theorem is referenced by: ackbij2lem3 10150 ackbij2 10152

W3C validator