ackbij2 - Metamath Proof Explorer

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

Theorem ackbij2 10240

Description: The Ackermann bijection, part 2: hereditarily finite sets can be represented by recursive binary notation. (Contributed by Stefan O'Rear, 18-Nov-2014.)

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

**Assertion**
Ref	Expression
ackbij2	⊢ 𝐻:∪ (𝑅₁ “ ω)–1-1-onto→ω

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

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

Step	Hyp	Ref	Expression
1		fveq2 6890	. . . . . 6 ⊢ (𝑎 = 𝑏 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘𝑏))
2		fvex 6903	. . . . . 6 ⊢ (rec(𝐺, ∅)‘𝑎) ∈ V
3	1, 2	f1iun 7932	. . . . 5 ⊢ (∀𝑎 ∈ ω ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→ω ∧ ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))) → ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅₁‘𝑎)–1-1→ω)
4		ackbij.f	. . . . . . . . 9 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
5		ackbij.g	. . . . . . . . 9 ⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑦 ∈ 𝒫 dom 𝑥 ↦ (𝐹‘(𝑥 “ 𝑦))))
6	4, 5	ackbij2lem2 10237	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)))
7		f1of1 6831	. . . . . . . 8 ⊢ ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1-onto→(card‘(𝑅₁‘𝑎)) → (rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→(card‘(𝑅₁‘𝑎)))
8	6, 7	syl 17	. . . . . . 7 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→(card‘(𝑅₁‘𝑎)))
9		ordom 7867	. . . . . . . 8 ⊢ Ord ω
10		r1fin 9770	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → (𝑅₁‘𝑎) ∈ Fin)
11		ficardom 9958	. . . . . . . . 9 ⊢ ((𝑅₁‘𝑎) ∈ Fin → (card‘(𝑅₁‘𝑎)) ∈ ω)
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (card‘(𝑅₁‘𝑎)) ∈ ω)
13		ordelss 6379	. . . . . . . 8 ⊢ ((Ord ω ∧ (card‘(𝑅₁‘𝑎)) ∈ ω) → (card‘(𝑅₁‘𝑎)) ⊆ ω)
14	9, 12, 13	sylancr 585	. . . . . . 7 ⊢ (𝑎 ∈ ω → (card‘(𝑅₁‘𝑎)) ⊆ ω)
15		f1ss 6792	. . . . . . 7 ⊢ (((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→(card‘(𝑅₁‘𝑎)) ∧ (card‘(𝑅₁‘𝑎)) ⊆ ω) → (rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→ω)
16	8, 14, 15	syl2anc 582	. . . . . 6 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→ω)
17		nnord 7865	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → Ord 𝑎)
18		nnord 7865	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → Ord 𝑏)
19		ordtri2or2 6462	. . . . . . . . 9 ⊢ ((Ord 𝑎 ∧ Ord 𝑏) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
20	17, 18, 19	syl2an 594	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
21	4, 5	ackbij2lem4 10239	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ ω ∧ 𝑎 ∈ ω) ∧ 𝑎 ⊆ 𝑏) → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏))
22	21	ex 411	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ 𝑎 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
23	22	ancoms 457	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
24	4, 5	ackbij2lem4 10239	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ω ∧ 𝑏 ∈ ω) ∧ 𝑏 ⊆ 𝑎) → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))
25	24	ex 411	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑏 ⊆ 𝑎 → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
26	23, 25	orim12d 961	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
27	20, 26	mpd 15	. . . . . . 7 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
28	27	ralrimiva 3144	. . . . . 6 ⊢ (𝑎 ∈ ω → ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
29	16, 28	jca 510	. . . . 5 ⊢ (𝑎 ∈ ω → ((rec(𝐺, ∅)‘𝑎):(𝑅₁‘𝑎)–1-1→ω ∧ ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
30	3, 29	mprg 3065	. . . 4 ⊢ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅₁‘𝑎)–1-1→ω
31		rdgfun 8418	. . . . . 6 ⊢ Fun rec(𝐺, ∅)
32		funiunfv 7249	. . . . . . 7 ⊢ (Fun rec(𝐺, ∅) → ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎) = ∪ (rec(𝐺, ∅) “ ω))
33	32	eqcomd 2736	. . . . . 6 ⊢ (Fun rec(𝐺, ∅) → ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎))
34		f1eq1 6781	. . . . . 6 ⊢ (∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎) → (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅₁ “ ω)–1-1→ω))
35	31, 33, 34	mp2b 10	. . . . 5 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅₁ “ ω)–1-1→ω)
36		r1funlim 9763	. . . . . . 7 ⊢ (Fun 𝑅₁ ∧ Lim dom 𝑅₁)
37	36	simpli 482	. . . . . 6 ⊢ Fun 𝑅₁
38		funiunfv 7249	. . . . . 6 ⊢ (Fun 𝑅₁ → ∪ 𝑎 ∈ ω (𝑅₁‘𝑎) = ∪ (𝑅₁ “ ω))
39		f1eq2 6782	. . . . . 6 ⊢ (∪ 𝑎 ∈ ω (𝑅₁‘𝑎) = ∪ (𝑅₁ “ ω) → (∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅₁‘𝑎)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅₁ “ ω)–1-1→ω))
40	37, 38, 39	mp2b 10	. . . . 5 ⊢ (∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅₁‘𝑎)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅₁ “ ω)–1-1→ω)
41	35, 40	bitr4i 277	. . . 4 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅₁‘𝑎)–1-1→ω)
42	30, 41	mpbir 230	. . 3 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1→ω
43		rnuni 6147	. . . 4 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎
44		eliun 5000	. . . . . 6 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ ∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎)
45		df-rex 3069	. . . . . 6 ⊢ (∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎 ↔ ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
46		funfn 6577	. . . . . . . . . . . 12 ⊢ (Fun rec(𝐺, ∅) ↔ rec(𝐺, ∅) Fn dom rec(𝐺, ∅))
47	31, 46	mpbi 229	. . . . . . . . . . 11 ⊢ rec(𝐺, ∅) Fn dom rec(𝐺, ∅)
48		rdgdmlim 8419	. . . . . . . . . . . 12 ⊢ Lim dom rec(𝐺, ∅)
49		limomss 7862	. . . . . . . . . . . 12 ⊢ (Lim dom rec(𝐺, ∅) → ω ⊆ dom rec(𝐺, ∅))
50	48, 49	ax-mp 5	. . . . . . . . . . 11 ⊢ ω ⊆ dom rec(𝐺, ∅)
51		fvelimab 6963	. . . . . . . . . . 11 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅)) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎))
52	47, 50, 51	mp2an 688	. . . . . . . . . 10 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎)
53	4, 5	ackbij2lem2 10237	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (rec(𝐺, ∅)‘𝑐):(𝑅₁‘𝑐)–1-1-onto→(card‘(𝑅₁‘𝑐)))
54		f1ofo 6839	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅₁‘𝑐)–1-1-onto→(card‘(𝑅₁‘𝑐)) → (rec(𝐺, ∅)‘𝑐):(𝑅₁‘𝑐)–onto→(card‘(𝑅₁‘𝑐)))
55		forn 6807	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅₁‘𝑐)–onto→(card‘(𝑅₁‘𝑐)) → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅₁‘𝑐)))
56	53, 54, 55	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅₁‘𝑐)))
57		r1fin 9770	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ ω → (𝑅₁‘𝑐) ∈ Fin)
58		ficardom 9958	. . . . . . . . . . . . . . 15 ⊢ ((𝑅₁‘𝑐) ∈ Fin → (card‘(𝑅₁‘𝑐)) ∈ ω)
59	57, 58	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (card‘(𝑅₁‘𝑐)) ∈ ω)
60		ordelss 6379	. . . . . . . . . . . . . 14 ⊢ ((Ord ω ∧ (card‘(𝑅₁‘𝑐)) ∈ ω) → (card‘(𝑅₁‘𝑐)) ⊆ ω)
61	9, 59, 60	sylancr 585	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → (card‘(𝑅₁‘𝑐)) ⊆ ω)
62	56, 61	eqsstrd 4019	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) ⊆ ω)
63		rneq 5934	. . . . . . . . . . . . 13 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran (rec(𝐺, ∅)‘𝑐) = ran 𝑎)
64	63	sseq1d 4012	. . . . . . . . . . . 12 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → (ran (rec(𝐺, ∅)‘𝑐) ⊆ ω ↔ ran 𝑎 ⊆ ω))
65	62, 64	syl5ibcom 244	. . . . . . . . . . 11 ⊢ (𝑐 ∈ ω → ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω))
66	65	rexlimiv 3146	. . . . . . . . . 10 ⊢ (∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω)
67	52, 66	sylbi 216	. . . . . . . . 9 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) → ran 𝑎 ⊆ ω)
68	67	sselda 3981	. . . . . . . 8 ⊢ ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
69	68	exlimiv 1931	. . . . . . 7 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
70		peano2 7883	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → suc 𝑏 ∈ ω)
71		fnfvima 7236	. . . . . . . . 9 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅) ∧ suc 𝑏 ∈ ω) → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
72	47, 50, 70, 71	mp3an12i 1463	. . . . . . . 8 ⊢ (𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
73		vex 3476	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
74		cardnn 9960	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) = suc 𝑏)
75		fvex 6903	. . . . . . . . . . . . . 14 ⊢ (𝑅₁‘suc 𝑏) ∈ V
76	36	simpri 484	. . . . . . . . . . . . . . . . 17 ⊢ Lim dom 𝑅₁
77		limomss 7862	. . . . . . . . . . . . . . . . 17 ⊢ (Lim dom 𝑅₁ → ω ⊆ dom 𝑅₁)
78	76, 77	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ ω ⊆ dom 𝑅₁
79	78	sseli 3977	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom 𝑅₁)
80		onssr1 9828	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ dom 𝑅₁ → suc 𝑏 ⊆ (𝑅₁‘suc 𝑏))
81	79, 80	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (𝑅₁‘suc 𝑏))
82		ssdomg 8998	. . . . . . . . . . . . . 14 ⊢ ((𝑅₁‘suc 𝑏) ∈ V → (suc 𝑏 ⊆ (𝑅₁‘suc 𝑏) → suc 𝑏 ≼ (𝑅₁‘suc 𝑏)))
83	75, 81, 82	mpsyl 68	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ≼ (𝑅₁‘suc 𝑏))
84		nnon 7863	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ On)
85		onenon 9946	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ On → suc 𝑏 ∈ dom card)
86	84, 85	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom card)
87		r1fin 9770	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → (𝑅₁‘suc 𝑏) ∈ Fin)
88		finnum 9945	. . . . . . . . . . . . . . 15 ⊢ ((𝑅₁‘suc 𝑏) ∈ Fin → (𝑅₁‘suc 𝑏) ∈ dom card)
89	87, 88	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → (𝑅₁‘suc 𝑏) ∈ dom card)
90		carddom2 9974	. . . . . . . . . . . . . 14 ⊢ ((suc 𝑏 ∈ dom card ∧ (𝑅₁‘suc 𝑏) ∈ dom card) → ((card‘suc 𝑏) ⊆ (card‘(𝑅₁‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅₁‘suc 𝑏)))
91	86, 89, 90	syl2anc 582	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → ((card‘suc 𝑏) ⊆ (card‘(𝑅₁‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅₁‘suc 𝑏)))
92	83, 91	mpbird 256	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) ⊆ (card‘(𝑅₁‘suc 𝑏)))
93	74, 92	eqsstrrd 4020	. . . . . . . . . . 11 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅₁‘suc 𝑏)))
94	70, 93	syl 17	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅₁‘suc 𝑏)))
95		sucssel 6458	. . . . . . . . . 10 ⊢ (𝑏 ∈ V → (suc 𝑏 ⊆ (card‘(𝑅₁‘suc 𝑏)) → 𝑏 ∈ (card‘(𝑅₁‘suc 𝑏))))
96	73, 94, 95	mpsyl 68	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → 𝑏 ∈ (card‘(𝑅₁‘suc 𝑏)))
97	4, 5	ackbij2lem2 10237	. . . . . . . . . 10 ⊢ (suc 𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)))
98		f1ofo 6839	. . . . . . . . . 10 ⊢ ((rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–1-1-onto→(card‘(𝑅₁‘suc 𝑏)) → (rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–onto→(card‘(𝑅₁‘suc 𝑏)))
99		forn 6807	. . . . . . . . . 10 ⊢ ((rec(𝐺, ∅)‘suc 𝑏):(𝑅₁‘suc 𝑏)–onto→(card‘(𝑅₁‘suc 𝑏)) → ran (rec(𝐺, ∅)‘suc 𝑏) = (card‘(𝑅₁‘suc 𝑏)))
100	70, 97, 98, 99	4syl 19	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → ran (rec(𝐺, ∅)‘suc 𝑏) = (card‘(𝑅₁‘suc 𝑏)))
101	96, 100	eleqtrrd 2834	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))
102		fvex 6903	. . . . . . . . 9 ⊢ (rec(𝐺, ∅)‘suc 𝑏) ∈ V
103		eleq1 2819	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω)))
104		rneq 5934	. . . . . . . . . . 11 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ran 𝑎 = ran (rec(𝐺, ∅)‘suc 𝑏))
105	104	eleq2d 2817	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑏 ∈ ran 𝑎 ↔ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)))
106	103, 105	anbi12d 629	. . . . . . . . 9 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ ((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))))
107	102, 106	spcev 3595	. . . . . . . 8 ⊢ (((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)) → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
108	72, 101, 107	syl2anc 582	. . . . . . 7 ⊢ (𝑏 ∈ ω → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
109	69, 108	impbii 208	. . . . . 6 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ 𝑏 ∈ ω)
110	44, 45, 109	3bitri 296	. . . . 5 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ 𝑏 ∈ ω)
111	110	eqriv 2727	. . . 4 ⊢ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 = ω
112	43, 111	eqtri 2758	. . 3 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ω
113		dff1o5 6841	. . 3 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1-onto→ω ↔ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1→ω ∧ ran ∪ (rec(𝐺, ∅) “ ω) = ω))
114	42, 112, 113	mpbir2an 707	. 2 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1-onto→ω
115		ackbij.h	. . 3 ⊢ 𝐻 = ∪ (rec(𝐺, ∅) “ ω)
116		f1oeq1 6820	. . 3 ⊢ (𝐻 = ∪ (rec(𝐺, ∅) “ ω) → (𝐻:∪ (𝑅₁ “ ω)–1-1-onto→ω ↔ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1-onto→ω))
117	115, 116	ax-mp 5	. 2 ⊢ (𝐻:∪ (𝑅₁ “ ω)–1-1-onto→ω ↔ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅₁ “ ω)–1-1-onto→ω)
118	114, 117	mpbir 230	1 ⊢ 𝐻:∪ (𝑅₁ “ ω)–1-1-onto→ω

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 = wceq 1539 ∃wex 1779 ∈ wcel 2104 ∀wral 3059 ∃wrex 3068 Vcvv 3472 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 𝒫 cpw 4601 {csn 4627 ∪ cuni 4907 ∪ ciun 4996 class class class wbr 5147 ↦ cmpt 5230 × cxp 5673 dom cdm 5675 ran crn 5676 “ cima 5678 Ord word 6362 Oncon0 6363 Lim wlim 6364 suc csuc 6365 Fun wfun 6536 Fn wfn 6537 –1-1→wf1 6539 –onto→wfo 6540 –1-1-onto→wf1o 6541 ‘cfv 6542 ωcom 7857 reccrdg 8411 ≼ cdom 8939 Fincfn 8941 𝑅₁cr1 9759 cardccrd 9932

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-oadd 8472 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-r1 9761 df-rank 9762 df-dju 9898 df-card 9936

This theorem is referenced by: r1om 10241

W3C validator