Theorem ackbij2 9654

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-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 6645	. . . . . 6 ⊢ (𝑎 = 𝑏 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘𝑏))
2		fvex 6658	. . . . . 6 ⊢ (rec(𝐺, ∅)‘𝑎) ∈ V
3	1, 2	f1iun 7627	. . . . 5 ⊢ (∀𝑎 ∈ ω ((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω ∧ ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))) → ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω)
4		ackbij.f	. . . . . . . . 9 ⊢ 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘∪ 𝑦 ∈ 𝑥 ({𝑦} × 𝒫 𝑦)))
5		ackbij.g	. . . . . . . . 9 ⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑦 ∈ 𝒫 dom 𝑥 ↦ (𝐹‘(𝑥 “ 𝑦))))
6	4, 5	ackbij2lem2 9651	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1-onto→(card‘(𝑅1‘𝑎)))
7		f1of1 6589	. . . . . . . 8 ⊢ ((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1-onto→(card‘(𝑅1‘𝑎)) → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→(card‘(𝑅1‘𝑎)))
8	6, 7	syl 17	. . . . . . 7 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→(card‘(𝑅1‘𝑎)))
9		ordom 7569	. . . . . . . 8 ⊢ Ord ω
10		r1fin 9186	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → (𝑅1‘𝑎) ∈ Fin)
11		ficardom 9374	. . . . . . . . 9 ⊢ ((𝑅1‘𝑎) ∈ Fin → (card‘(𝑅1‘𝑎)) ∈ ω)
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (card‘(𝑅1‘𝑎)) ∈ ω)
13		ordelss 6175	. . . . . . . 8 ⊢ ((Ord ω ∧ (card‘(𝑅1‘𝑎)) ∈ ω) → (card‘(𝑅1‘𝑎)) ⊆ ω)
14	9, 12, 13	sylancr 590	. . . . . . 7 ⊢ (𝑎 ∈ ω → (card‘(𝑅1‘𝑎)) ⊆ ω)
15		f1ss 6555	. . . . . . 7 ⊢ (((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→(card‘(𝑅1‘𝑎)) ∧ (card‘(𝑅1‘𝑎)) ⊆ ω) → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω)
16	8, 14, 15	syl2anc 587	. . . . . 6 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω)
17		nnord 7568	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → Ord 𝑎)
18		nnord 7568	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → Ord 𝑏)
19		ordtri2or2 6255	. . . . . . . . 9 ⊢ ((Ord 𝑎 ∧ Ord 𝑏) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
20	17, 18, 19	syl2an 598	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
21	4, 5	ackbij2lem4 9653	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ ω ∧ 𝑎 ∈ ω) ∧ 𝑎 ⊆ 𝑏) → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏))
22	21	ex 416	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ 𝑎 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
23	22	ancoms 462	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
24	4, 5	ackbij2lem4 9653	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ω ∧ 𝑏 ∈ ω) ∧ 𝑏 ⊆ 𝑎) → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))
25	24	ex 416	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑏 ⊆ 𝑎 → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
26	23, 25	orim12d 962	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
27	20, 26	mpd 15	. . . . . . 7 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
28	27	ralrimiva 3149	. . . . . 6 ⊢ (𝑎 ∈ ω → ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
29	16, 28	jca 515	. . . . 5 ⊢ (𝑎 ∈ ω → ((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω ∧ ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
30	3, 29	mprg 3120	. . . 4 ⊢ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω
31		rdgfun 8035	. . . . . 6 ⊢ Fun rec(𝐺, ∅)
32		funiunfv 6985	. . . . . . 7 ⊢ (Fun rec(𝐺, ∅) → ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎) = ∪ (rec(𝐺, ∅) “ ω))
33	32	eqcomd 2804	. . . . . 6 ⊢ (Fun rec(𝐺, ∅) → ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎))
34		f1eq1 6544	. . . . . 6 ⊢ (∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎) → (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅1 “ ω)–1-1→ω))
35	31, 33, 34	mp2b 10	. . . . 5 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅1 “ ω)–1-1→ω)
36		r1funlim 9179	. . . . . . 7 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1)
37	36	simpli 487	. . . . . 6 ⊢ Fun 𝑅1
38		funiunfv 6985	. . . . . 6 ⊢ (Fun 𝑅1 → ∪ 𝑎 ∈ ω (𝑅1‘𝑎) = ∪ (𝑅1 “ ω))
39		f1eq2 6545	. . . . . 6 ⊢ (∪ 𝑎 ∈ ω (𝑅1‘𝑎) = ∪ (𝑅1 “ ω) → (∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅1 “ ω)–1-1→ω))
40	37, 38, 39	mp2b 10	. . . . 5 ⊢ (∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ (𝑅1 “ ω)–1-1→ω)
41	35, 40	bitr4i 281	. . . 4 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω)
42	30, 41	mpbir 234	. . 3 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω
43		rnuni 5974	. . . 4 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎
44		eliun 4885	. . . . . 6 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ ∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎)
45		df-rex 3112	. . . . . 6 ⊢ (∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎 ↔ ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
46		funfn 6354	. . . . . . . . . . . 12 ⊢ (Fun rec(𝐺, ∅) ↔ rec(𝐺, ∅) Fn dom rec(𝐺, ∅))
47	31, 46	mpbi 233	. . . . . . . . . . 11 ⊢ rec(𝐺, ∅) Fn dom rec(𝐺, ∅)
48		rdgdmlim 8036	. . . . . . . . . . . 12 ⊢ Lim dom rec(𝐺, ∅)
49		limomss 7565	. . . . . . . . . . . 12 ⊢ (Lim dom rec(𝐺, ∅) → ω ⊆ dom rec(𝐺, ∅))
50	48, 49	ax-mp 5	. . . . . . . . . . 11 ⊢ ω ⊆ dom rec(𝐺, ∅)
51		fvelimab 6712	. . . . . . . . . . 11 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅)) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎))
52	47, 50, 51	mp2an 691	. . . . . . . . . 10 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎)
53	4, 5	ackbij2lem2 9651	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–1-1-onto→(card‘(𝑅1‘𝑐)))
54		f1ofo 6597	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–1-1-onto→(card‘(𝑅1‘𝑐)) → (rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–onto→(card‘(𝑅1‘𝑐)))
55		forn 6568	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–onto→(card‘(𝑅1‘𝑐)) → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅1‘𝑐)))
56	53, 54, 55	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅1‘𝑐)))
57		r1fin 9186	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ ω → (𝑅1‘𝑐) ∈ Fin)
58		ficardom 9374	. . . . . . . . . . . . . . 15 ⊢ ((𝑅1‘𝑐) ∈ Fin → (card‘(𝑅1‘𝑐)) ∈ ω)
59	57, 58	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (card‘(𝑅1‘𝑐)) ∈ ω)
60		ordelss 6175	. . . . . . . . . . . . . 14 ⊢ ((Ord ω ∧ (card‘(𝑅1‘𝑐)) ∈ ω) → (card‘(𝑅1‘𝑐)) ⊆ ω)
61	9, 59, 60	sylancr 590	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → (card‘(𝑅1‘𝑐)) ⊆ ω)
62	56, 61	eqsstrd 3953	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) ⊆ ω)
63		rneq 5770	. . . . . . . . . . . . 13 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran (rec(𝐺, ∅)‘𝑐) = ran 𝑎)
64	63	sseq1d 3946	. . . . . . . . . . . 12 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → (ran (rec(𝐺, ∅)‘𝑐) ⊆ ω ↔ ran 𝑎 ⊆ ω))
65	62, 64	syl5ibcom 248	. . . . . . . . . . 11 ⊢ (𝑐 ∈ ω → ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω))
66	65	rexlimiv 3239	. . . . . . . . . 10 ⊢ (∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω)
67	52, 66	sylbi 220	. . . . . . . . 9 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) → ran 𝑎 ⊆ ω)
68	67	sselda 3915	. . . . . . . 8 ⊢ ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
69	68	exlimiv 1931	. . . . . . 7 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
70		peano2 7582	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → suc 𝑏 ∈ ω)
71		fnfvima 6973	. . . . . . . . 9 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅) ∧ suc 𝑏 ∈ ω) → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
72	47, 50, 70, 71	mp3an12i 1462	. . . . . . . 8 ⊢ (𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
73		vex 3444	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
74		cardnn 9376	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) = suc 𝑏)
75		fvex 6658	. . . . . . . . . . . . . 14 ⊢ (𝑅1‘suc 𝑏) ∈ V
76	36	simpri 489	. . . . . . . . . . . . . . . . 17 ⊢ Lim dom 𝑅1
77		limomss 7565	. . . . . . . . . . . . . . . . 17 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1)
78	76, 77	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ ω ⊆ dom 𝑅1
79	78	sseli 3911	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom 𝑅1)
80		onssr1 9244	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ dom 𝑅1 → suc 𝑏 ⊆ (𝑅1‘suc 𝑏))
81	79, 80	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (𝑅1‘suc 𝑏))
82		ssdomg 8538	. . . . . . . . . . . . . 14 ⊢ ((𝑅1‘suc 𝑏) ∈ V → (suc 𝑏 ⊆ (𝑅1‘suc 𝑏) → suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
83	75, 81, 82	mpsyl 68	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ≼ (𝑅1‘suc 𝑏))
84		nnon 7566	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ On)
85		onenon 9362	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ On → suc 𝑏 ∈ dom card)
86	84, 85	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom card)
87		r1fin 9186	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → (𝑅1‘suc 𝑏) ∈ Fin)
88		finnum 9361	. . . . . . . . . . . . . . 15 ⊢ ((𝑅1‘suc 𝑏) ∈ Fin → (𝑅1‘suc 𝑏) ∈ dom card)
89	87, 88	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → (𝑅1‘suc 𝑏) ∈ dom card)
90		carddom2 9390	. . . . . . . . . . . . . 14 ⊢ ((suc 𝑏 ∈ dom card ∧ (𝑅1‘suc 𝑏) ∈ dom card) → ((card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
91	86, 89, 90	syl2anc 587	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → ((card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
92	83, 91	mpbird 260	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)))
93	74, 92	eqsstrrd 3954	. . . . . . . . . . 11 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)))
94	70, 93	syl 17	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)))
95		sucssel 6251	. . . . . . . . . 10 ⊢ (𝑏 ∈ V → (suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)) → 𝑏 ∈ (card‘(𝑅1‘suc 𝑏))))
96	73, 94, 95	mpsyl 68	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → 𝑏 ∈ (card‘(𝑅1‘suc 𝑏)))
97	4, 5	ackbij2lem2 9651	. . . . . . . . . 10 ⊢ (suc 𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–1-1-onto→(card‘(𝑅1‘suc 𝑏)))
98		f1ofo 6597	. . . . . . . . . 10 ⊢ ((rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–1-1-onto→(card‘(𝑅1‘suc 𝑏)) → (rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–onto→(card‘(𝑅1‘suc 𝑏)))
99		forn 6568	. . . . . . . . . 10 ⊢ ((rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–onto→(card‘(𝑅1‘suc 𝑏)) → ran (rec(𝐺, ∅)‘suc 𝑏) = (card‘(𝑅1‘suc 𝑏)))
100	70, 97, 98, 99	4syl 19	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → ran (rec(𝐺, ∅)‘suc 𝑏) = (card‘(𝑅1‘suc 𝑏)))
101	96, 100	eleqtrrd 2893	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))
102		fvex 6658	. . . . . . . . 9 ⊢ (rec(𝐺, ∅)‘suc 𝑏) ∈ V
103		eleq1 2877	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω)))
104		rneq 5770	. . . . . . . . . . 11 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ran 𝑎 = ran (rec(𝐺, ∅)‘suc 𝑏))
105	104	eleq2d 2875	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑏 ∈ ran 𝑎 ↔ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)))
106	103, 105	anbi12d 633	. . . . . . . . 9 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ ((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))))
107	102, 106	spcev 3555	. . . . . . . 8 ⊢ (((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)) → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
108	72, 101, 107	syl2anc 587	. . . . . . 7 ⊢ (𝑏 ∈ ω → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
109	69, 108	impbii 212	. . . . . 6 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ 𝑏 ∈ ω)
110	44, 45, 109	3bitri 300	. . . . 5 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ 𝑏 ∈ ω)
111	110	eqriv 2795	. . . 4 ⊢ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 = ω
112	43, 111	eqtri 2821	. . 3 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ω
113		dff1o5 6599	. . 3 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω ↔ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ∧ ran ∪ (rec(𝐺, ∅) “ ω) = ω))
114	42, 112, 113	mpbir2an 710	. 2 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω
115		ackbij.h	. . 3 ⊢ 𝐻 = ∪ (rec(𝐺, ∅) “ ω)
116		f1oeq1 6579	. . 3 ⊢ (𝐻 = ∪ (rec(𝐺, ∅) “ ω) → (𝐻:∪ (𝑅1 “ ω)–1-1-onto→ω ↔ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω))
117	115, 116	ax-mp 5	. 2 ⊢ (𝐻:∪ (𝑅1 “ ω)–1-1-onto→ω ↔ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω)
118	114, 117	mpbir 234	1 ⊢ 𝐻:∪ (𝑅1 “ ω)–1-1-onto→ω

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   = wceq 1538  ∃wex 1781   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107  Vcvv 3441   ∩ cin 3880   ⊆ wss 3881  ∅c0 4243  𝒫 cpw 4497  {csn 4525  ∪ cuni 4800  ∪ ciun 4881   class class class wbr 5030   ↦ cmpt 5110   × cxp 5517  dom cdm 5519  ran crn 5520   “ cima 5522  Ord word 6158  Oncon0 6159  Lim wlim 6160  suc csuc 6161  Fun wfun 6318   Fn wfn 6319  –1-1→wf1 6321  –onto→wfo 6322  –1-1-onto→wf1o 6323  ‘cfv 6324  ωcom 7560  reccrdg 8028   ≼ cdom 8490  Fincfn 8492  𝑅₁cr1 9175  cardccrd 9348

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-2o 8086  df-oadd 8089  df-er 8272  df-map 8391  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-r1 9177  df-rank 9178  df-dju 9314  df-card 9352

This theorem is referenced by:  r1om  9655