Theorem ackbij2 10202

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 6861	. . . . . 6 ⊢ (𝑎 = 𝑏 → (rec(𝐺, ∅)‘𝑎) = (rec(𝐺, ∅)‘𝑏))
2		fvex 6874	. . . . . 6 ⊢ (rec(𝐺, ∅)‘𝑎) ∈ V
3	1, 2	f1iun 7925	. . . . 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 10199	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1-onto→(card‘(𝑅1‘𝑎)))
7		f1of1 6802	. . . . . . . 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 7855	. . . . . . . 8 ⊢ Ord ω
10		r1fin 9733	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → (𝑅1‘𝑎) ∈ Fin)
11		ficardom 9921	. . . . . . . . 9 ⊢ ((𝑅1‘𝑎) ∈ Fin → (card‘(𝑅1‘𝑎)) ∈ ω)
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝑎 ∈ ω → (card‘(𝑅1‘𝑎)) ∈ ω)
13		ordelss 6351	. . . . . . . 8 ⊢ ((Ord ω ∧ (card‘(𝑅1‘𝑎)) ∈ ω) → (card‘(𝑅1‘𝑎)) ⊆ ω)
14	9, 12, 13	sylancr 587	. . . . . . 7 ⊢ (𝑎 ∈ ω → (card‘(𝑅1‘𝑎)) ⊆ ω)
15		f1ss 6764	. . . . . . 7 ⊢ (((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→(card‘(𝑅1‘𝑎)) ∧ (card‘(𝑅1‘𝑎)) ⊆ ω) → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω)
16	8, 14, 15	syl2anc 584	. . . . . 6 ⊢ (𝑎 ∈ ω → (rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω)
17		nnord 7853	. . . . . . . . 9 ⊢ (𝑎 ∈ ω → Ord 𝑎)
18		nnord 7853	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → Ord 𝑏)
19		ordtri2or2 6436	. . . . . . . . 9 ⊢ ((Ord 𝑎 ∧ Ord 𝑏) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
20	17, 18, 19	syl2an 596	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎))
21	4, 5	ackbij2lem4 10201	. . . . . . . . . . 11 ⊢ (((𝑏 ∈ ω ∧ 𝑎 ∈ ω) ∧ 𝑎 ⊆ 𝑏) → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏))
22	21	ex 412	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ω ∧ 𝑎 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
23	22	ancoms 458	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑎 ⊆ 𝑏 → (rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏)))
24	4, 5	ackbij2lem4 10201	. . . . . . . . . 10 ⊢ (((𝑎 ∈ ω ∧ 𝑏 ∈ ω) ∧ 𝑏 ⊆ 𝑎) → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))
25	24	ex 412	. . . . . . . . 9 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → (𝑏 ⊆ 𝑎 → (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
26	23, 25	orim12d 966	. . . . . . . 8 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝑎 ⊆ 𝑏 ∨ 𝑏 ⊆ 𝑎) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
27	20, 26	mpd 15	. . . . . . 7 ⊢ ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
28	27	ralrimiva 3126	. . . . . 6 ⊢ (𝑎 ∈ ω → ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎)))
29	16, 28	jca 511	. . . . 5 ⊢ (𝑎 ∈ ω → ((rec(𝐺, ∅)‘𝑎):(𝑅1‘𝑎)–1-1→ω ∧ ∀𝑏 ∈ ω ((rec(𝐺, ∅)‘𝑎) ⊆ (rec(𝐺, ∅)‘𝑏) ∨ (rec(𝐺, ∅)‘𝑏) ⊆ (rec(𝐺, ∅)‘𝑎))))
30	3, 29	mprg 3051	. . . 4 ⊢ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω
31		rdgfun 8387	. . . . . 6 ⊢ Fun rec(𝐺, ∅)
32		funiunfv 7225	. . . . . . 7 ⊢ (Fun rec(𝐺, ∅) → ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎) = ∪ (rec(𝐺, ∅) “ ω))
33	32	eqcomd 2736	. . . . . 6 ⊢ (Fun rec(𝐺, ∅) → ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎))
34		f1eq1 6754	. . . . . 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 9726	. . . . . . 7 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1)
37	36	simpli 483	. . . . . 6 ⊢ Fun 𝑅1
38		funiunfv 7225	. . . . . 6 ⊢ (Fun 𝑅1 → ∪ 𝑎 ∈ ω (𝑅1‘𝑎) = ∪ (𝑅1 “ ω))
39		f1eq2 6755	. . . . . 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 278	. . . 4 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ↔ ∪ 𝑎 ∈ ω (rec(𝐺, ∅)‘𝑎):∪ 𝑎 ∈ ω (𝑅1‘𝑎)–1-1→ω)
42	30, 41	mpbir 231	. . 3 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω
43		rnuni 6124	. . . 4 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎
44		eliun 4962	. . . . . 6 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ ∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎)
45		df-rex 3055	. . . . . 6 ⊢ (∃𝑎 ∈ (rec(𝐺, ∅) “ ω)𝑏 ∈ ran 𝑎 ↔ ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
46		funfn 6549	. . . . . . . . . . . 12 ⊢ (Fun rec(𝐺, ∅) ↔ rec(𝐺, ∅) Fn dom rec(𝐺, ∅))
47	31, 46	mpbi 230	. . . . . . . . . . 11 ⊢ rec(𝐺, ∅) Fn dom rec(𝐺, ∅)
48		rdgdmlim 8388	. . . . . . . . . . . 12 ⊢ Lim dom rec(𝐺, ∅)
49		limomss 7850	. . . . . . . . . . . 12 ⊢ (Lim dom rec(𝐺, ∅) → ω ⊆ dom rec(𝐺, ∅))
50	48, 49	ax-mp 5	. . . . . . . . . . 11 ⊢ ω ⊆ dom rec(𝐺, ∅)
51		fvelimab 6936	. . . . . . . . . . 11 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅)) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎))
52	47, 50, 51	mp2an 692	. . . . . . . . . 10 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ ∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎)
53	4, 5	ackbij2lem2 10199	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–1-1-onto→(card‘(𝑅1‘𝑐)))
54		f1ofo 6810	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–1-1-onto→(card‘(𝑅1‘𝑐)) → (rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–onto→(card‘(𝑅1‘𝑐)))
55		forn 6778	. . . . . . . . . . . . . 14 ⊢ ((rec(𝐺, ∅)‘𝑐):(𝑅1‘𝑐)–onto→(card‘(𝑅1‘𝑐)) → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅1‘𝑐)))
56	53, 54, 55	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) = (card‘(𝑅1‘𝑐)))
57		r1fin 9733	. . . . . . . . . . . . . . 15 ⊢ (𝑐 ∈ ω → (𝑅1‘𝑐) ∈ Fin)
58		ficardom 9921	. . . . . . . . . . . . . . 15 ⊢ ((𝑅1‘𝑐) ∈ Fin → (card‘(𝑅1‘𝑐)) ∈ ω)
59	57, 58	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ ω → (card‘(𝑅1‘𝑐)) ∈ ω)
60		ordelss 6351	. . . . . . . . . . . . . 14 ⊢ ((Ord ω ∧ (card‘(𝑅1‘𝑐)) ∈ ω) → (card‘(𝑅1‘𝑐)) ⊆ ω)
61	9, 59, 60	sylancr 587	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ ω → (card‘(𝑅1‘𝑐)) ⊆ ω)
62	56, 61	eqsstrd 3984	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ ω → ran (rec(𝐺, ∅)‘𝑐) ⊆ ω)
63		rneq 5903	. . . . . . . . . . . . 13 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran (rec(𝐺, ∅)‘𝑐) = ran 𝑎)
64	63	sseq1d 3981	. . . . . . . . . . . 12 ⊢ ((rec(𝐺, ∅)‘𝑐) = 𝑎 → (ran (rec(𝐺, ∅)‘𝑐) ⊆ ω ↔ ran 𝑎 ⊆ ω))
65	62, 64	syl5ibcom 245	. . . . . . . . . . 11 ⊢ (𝑐 ∈ ω → ((rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω))
66	65	rexlimiv 3128	. . . . . . . . . 10 ⊢ (∃𝑐 ∈ ω (rec(𝐺, ∅)‘𝑐) = 𝑎 → ran 𝑎 ⊆ ω)
67	52, 66	sylbi 217	. . . . . . . . 9 ⊢ (𝑎 ∈ (rec(𝐺, ∅) “ ω) → ran 𝑎 ⊆ ω)
68	67	sselda 3949	. . . . . . . 8 ⊢ ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
69	68	exlimiv 1930	. . . . . . 7 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) → 𝑏 ∈ ω)
70		peano2 7869	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → suc 𝑏 ∈ ω)
71		fnfvima 7210	. . . . . . . . 9 ⊢ ((rec(𝐺, ∅) Fn dom rec(𝐺, ∅) ∧ ω ⊆ dom rec(𝐺, ∅) ∧ suc 𝑏 ∈ ω) → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
72	47, 50, 70, 71	mp3an12i 1467	. . . . . . . 8 ⊢ (𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω))
73		vex 3454	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
74		cardnn 9923	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) = suc 𝑏)
75		fvex 6874	. . . . . . . . . . . . . 14 ⊢ (𝑅1‘suc 𝑏) ∈ V
76	36	simpri 485	. . . . . . . . . . . . . . . . 17 ⊢ Lim dom 𝑅1
77		limomss 7850	. . . . . . . . . . . . . . . . 17 ⊢ (Lim dom 𝑅1 → ω ⊆ dom 𝑅1)
78	76, 77	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ ω ⊆ dom 𝑅1
79	78	sseli 3945	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom 𝑅1)
80		onssr1 9791	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ dom 𝑅1 → suc 𝑏 ⊆ (𝑅1‘suc 𝑏))
81	79, 80	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (𝑅1‘suc 𝑏))
82		ssdomg 8974	. . . . . . . . . . . . . 14 ⊢ ((𝑅1‘suc 𝑏) ∈ V → (suc 𝑏 ⊆ (𝑅1‘suc 𝑏) → suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
83	75, 81, 82	mpsyl 68	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ≼ (𝑅1‘suc 𝑏))
84		nnon 7851	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ On)
85		onenon 9909	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ On → suc 𝑏 ∈ dom card)
86	84, 85	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ∈ dom card)
87		r1fin 9733	. . . . . . . . . . . . . . 15 ⊢ (suc 𝑏 ∈ ω → (𝑅1‘suc 𝑏) ∈ Fin)
88		finnum 9908	. . . . . . . . . . . . . . 15 ⊢ ((𝑅1‘suc 𝑏) ∈ Fin → (𝑅1‘suc 𝑏) ∈ dom card)
89	87, 88	syl 17	. . . . . . . . . . . . . 14 ⊢ (suc 𝑏 ∈ ω → (𝑅1‘suc 𝑏) ∈ dom card)
90		carddom2 9937	. . . . . . . . . . . . . 14 ⊢ ((suc 𝑏 ∈ dom card ∧ (𝑅1‘suc 𝑏) ∈ dom card) → ((card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
91	86, 89, 90	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (suc 𝑏 ∈ ω → ((card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)) ↔ suc 𝑏 ≼ (𝑅1‘suc 𝑏)))
92	83, 91	mpbird 257	. . . . . . . . . . . 12 ⊢ (suc 𝑏 ∈ ω → (card‘suc 𝑏) ⊆ (card‘(𝑅1‘suc 𝑏)))
93	74, 92	eqsstrrd 3985	. . . . . . . . . . 11 ⊢ (suc 𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)))
94	70, 93	syl 17	. . . . . . . . . 10 ⊢ (𝑏 ∈ ω → suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)))
95		sucssel 6432	. . . . . . . . . 10 ⊢ (𝑏 ∈ V → (suc 𝑏 ⊆ (card‘(𝑅1‘suc 𝑏)) → 𝑏 ∈ (card‘(𝑅1‘suc 𝑏))))
96	73, 94, 95	mpsyl 68	. . . . . . . . 9 ⊢ (𝑏 ∈ ω → 𝑏 ∈ (card‘(𝑅1‘suc 𝑏)))
97	4, 5	ackbij2lem2 10199	. . . . . . . . . 10 ⊢ (suc 𝑏 ∈ ω → (rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–1-1-onto→(card‘(𝑅1‘suc 𝑏)))
98		f1ofo 6810	. . . . . . . . . 10 ⊢ ((rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–1-1-onto→(card‘(𝑅1‘suc 𝑏)) → (rec(𝐺, ∅)‘suc 𝑏):(𝑅1‘suc 𝑏)–onto→(card‘(𝑅1‘suc 𝑏)))
99		forn 6778	. . . . . . . . . 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 2832	. . . . . . . 8 ⊢ (𝑏 ∈ ω → 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))
102		fvex 6874	. . . . . . . . 9 ⊢ (rec(𝐺, ∅)‘suc 𝑏) ∈ V
103		eleq1 2817	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑎 ∈ (rec(𝐺, ∅) “ ω) ↔ (rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω)))
104		rneq 5903	. . . . . . . . . . 11 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ran 𝑎 = ran (rec(𝐺, ∅)‘suc 𝑏))
105	104	eleq2d 2815	. . . . . . . . . 10 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → (𝑏 ∈ ran 𝑎 ↔ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)))
106	103, 105	anbi12d 632	. . . . . . . . 9 ⊢ (𝑎 = (rec(𝐺, ∅)‘suc 𝑏) → ((𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ ((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏))))
107	102, 106	spcev 3575	. . . . . . . 8 ⊢ (((rec(𝐺, ∅)‘suc 𝑏) ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran (rec(𝐺, ∅)‘suc 𝑏)) → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
108	72, 101, 107	syl2anc 584	. . . . . . 7 ⊢ (𝑏 ∈ ω → ∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎))
109	69, 108	impbii 209	. . . . . 6 ⊢ (∃𝑎(𝑎 ∈ (rec(𝐺, ∅) “ ω) ∧ 𝑏 ∈ ran 𝑎) ↔ 𝑏 ∈ ω)
110	44, 45, 109	3bitri 297	. . . . 5 ⊢ (𝑏 ∈ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 ↔ 𝑏 ∈ ω)
111	110	eqriv 2727	. . . 4 ⊢ ∪ 𝑎 ∈ (rec(𝐺, ∅) “ ω)ran 𝑎 = ω
112	43, 111	eqtri 2753	. . 3 ⊢ ran ∪ (rec(𝐺, ∅) “ ω) = ω
113		dff1o5 6812	. . 3 ⊢ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω ↔ (∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1→ω ∧ ran ∪ (rec(𝐺, ∅) “ ω) = ω))
114	42, 112, 113	mpbir2an 711	. 2 ⊢ ∪ (rec(𝐺, ∅) “ ω):∪ (𝑅1 “ ω)–1-1-onto→ω
115		ackbij.h	. . 3 ⊢ 𝐻 = ∪ (rec(𝐺, ∅) “ ω)
116		f1oeq1 6791	. . 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 231	1 ⊢ 𝐻:∪ (𝑅1 “ ω)–1-1-onto→ω

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∀wral 3045  ∃wrex 3054  Vcvv 3450   ∩ cin 3916   ⊆ wss 3917  ∅c0 4299  𝒫 cpw 4566  {csn 4592  ∪ cuni 4874  ∪ ciun 4958   class class class wbr 5110   ↦ cmpt 5191   × cxp 5639  dom cdm 5641  ran crn 5642   “ cima 5644  Ord word 6334  Oncon0 6335  Lim wlim 6336  suc csuc 6337  Fun wfun 6508   Fn wfn 6509  –1-1→wf1 6511  –onto→wfo 6512  –1-1-onto→wf1o 6513  ‘cfv 6514  ωcom 7845  reccrdg 8380   ≼ cdom 8919  Fincfn 8921  𝑅₁cr1 9722  cardccrd 9895

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-1o 8437  df-2o 8438  df-oadd 8441  df-er 8674  df-map 8804  df-en 8922  df-dom 8923  df-sdom 8924  df-fin 8925  df-r1 9724  df-rank 9725  df-dju 9861  df-card 9899

This theorem is referenced by:  r1om  10203