Theorem hashunlem 10391

Description: Lemma for hashun 10392. Ordinal size of the union. (Contributed by Jim Kingdon, 25-Feb-2022.)

Hypotheses

Ref	Expression
hashunlem.a	⊢ (𝜑 → 𝐴 ∈ Fin)
hashunlem.b	⊢ (𝜑 → 𝐵 ∈ Fin)
hashunlem.disj	⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
hashunlem.n	⊢ (𝜑 → 𝑁 ∈ ω)
hashunlem.m	⊢ (𝜑 → 𝑀 ∈ ω)
hashunlem.an	⊢ (𝜑 → 𝐴 ≈ 𝑁)
hashunlem.bm	⊢ (𝜑 → 𝐵 ≈ 𝑀)

Assertion

Ref	Expression
hashunlem	⊢ (𝜑 → (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑀))

Proof of Theorem hashunlem

Dummy variables 𝑗 𝑤 𝑘 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq1 3878	. . . . 5 ⊢ (𝑤 = ∅ → (𝑤 ≈ 𝑗 ↔ ∅ ≈ 𝑗))
2		uneq2 3171	. . . . . 6 ⊢ (𝑤 = ∅ → (𝐴 ∪ 𝑤) = (𝐴 ∪ ∅))
3	2	breq1d 3885	. . . . 5 ⊢ (𝑤 = ∅ → ((𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗)))
4	1, 3	anbi12d 460	. . . 4 ⊢ (𝑤 = ∅ → ((𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ (∅ ≈ 𝑗 ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗))))
5	4	rexbidv 2397	. . 3 ⊢ (𝑤 = ∅ → (∃𝑗 ∈ ω (𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ ∃𝑗 ∈ ω (∅ ≈ 𝑗 ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗))))
6		breq1 3878	. . . . 5 ⊢ (𝑤 = 𝑦 → (𝑤 ≈ 𝑗 ↔ 𝑦 ≈ 𝑗))
7		uneq2 3171	. . . . . 6 ⊢ (𝑤 = 𝑦 → (𝐴 ∪ 𝑤) = (𝐴 ∪ 𝑦))
8	7	breq1d 3885	. . . . 5 ⊢ (𝑤 = 𝑦 → ((𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗)))
9	6, 8	anbi12d 460	. . . 4 ⊢ (𝑤 = 𝑦 → ((𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))))
10	9	rexbidv 2397	. . 3 ⊢ (𝑤 = 𝑦 → (∃𝑗 ∈ ω (𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ ∃𝑗 ∈ ω (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))))
11		breq1 3878	. . . . 5 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (𝑤 ≈ 𝑗 ↔ (𝑦 ∪ {𝑧}) ≈ 𝑗))
12		uneq2 3171	. . . . . 6 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (𝐴 ∪ 𝑤) = (𝐴 ∪ (𝑦 ∪ {𝑧})))
13	12	breq1d 3885	. . . . 5 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → ((𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗)))
14	11, 13	anbi12d 460	. . . 4 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → ((𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ ((𝑦 ∪ {𝑧}) ≈ 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗))))
15	14	rexbidv 2397	. . 3 ⊢ (𝑤 = (𝑦 ∪ {𝑧}) → (∃𝑗 ∈ ω (𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ ∃𝑗 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗))))
16		breq1 3878	. . . . 5 ⊢ (𝑤 = 𝐵 → (𝑤 ≈ 𝑗 ↔ 𝐵 ≈ 𝑗))
17		uneq2 3171	. . . . . 6 ⊢ (𝑤 = 𝐵 → (𝐴 ∪ 𝑤) = (𝐴 ∪ 𝐵))
18	17	breq1d 3885	. . . . 5 ⊢ (𝑤 = 𝐵 → ((𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))
19	16, 18	anbi12d 460	. . . 4 ⊢ (𝑤 = 𝐵 → ((𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗))))
20	19	rexbidv 2397	. . 3 ⊢ (𝑤 = 𝐵 → (∃𝑗 ∈ ω (𝑤 ≈ 𝑗 ∧ (𝐴 ∪ 𝑤) ≈ (𝑁 +o 𝑗)) ↔ ∃𝑗 ∈ ω (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗))))
21		peano1 4446	. . . . 5 ⊢ ∅ ∈ ω
22	21	a1i 9	. . . 4 ⊢ (𝜑 → ∅ ∈ ω)
23		0ex 3995	. . . . . 6 ⊢ ∅ ∈ V
24	23	enref 6589	. . . . 5 ⊢ ∅ ≈ ∅
25	24	a1i 9	. . . 4 ⊢ (𝜑 → ∅ ≈ ∅)
26		hashunlem.an	. . . . 5 ⊢ (𝜑 → 𝐴 ≈ 𝑁)
27		un0 3343	. . . . . 6 ⊢ (𝐴 ∪ ∅) = 𝐴
28	27	a1i 9	. . . . 5 ⊢ (𝜑 → (𝐴 ∪ ∅) = 𝐴)
29		hashunlem.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ω)
30		nna0 6300	. . . . . 6 ⊢ (𝑁 ∈ ω → (𝑁 +o ∅) = 𝑁)
31	29, 30	syl 14	. . . . 5 ⊢ (𝜑 → (𝑁 +o ∅) = 𝑁)
32	26, 28, 31	3brtr4d 3905	. . . 4 ⊢ (𝜑 → (𝐴 ∪ ∅) ≈ (𝑁 +o ∅))
33		breq2 3879	. . . . . 6 ⊢ (𝑗 = ∅ → (∅ ≈ 𝑗 ↔ ∅ ≈ ∅))
34		oveq2 5714	. . . . . . 7 ⊢ (𝑗 = ∅ → (𝑁 +o 𝑗) = (𝑁 +o ∅))
35	34	breq2d 3887	. . . . . 6 ⊢ (𝑗 = ∅ → ((𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ ∅) ≈ (𝑁 +o ∅)))
36	33, 35	anbi12d 460	. . . . 5 ⊢ (𝑗 = ∅ → ((∅ ≈ 𝑗 ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗)) ↔ (∅ ≈ ∅ ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o ∅))))
37	36	rspcev 2744	. . . 4 ⊢ ((∅ ∈ ω ∧ (∅ ≈ ∅ ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o ∅))) → ∃𝑗 ∈ ω (∅ ≈ 𝑗 ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗)))
38	22, 25, 32, 37	syl12anc 1182	. . 3 ⊢ (𝜑 → ∃𝑗 ∈ ω (∅ ≈ 𝑗 ∧ (𝐴 ∪ ∅) ≈ (𝑁 +o 𝑗)))
39		peano2 4447	. . . . . . . 8 ⊢ (𝑗 ∈ ω → suc 𝑗 ∈ ω)
40	39	ad2antlr 476	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → suc 𝑗 ∈ ω)
41		simp-4r 512	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑦 ∈ Fin)
42		vex 2644	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
43	42	a1i 9	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑧 ∈ V)
44		simprr 502	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) → 𝑧 ∈ (𝐵 ∖ 𝑦))
45	44	ad2antrr 475	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑧 ∈ (𝐵 ∖ 𝑦))
46	45	eldifbd 3033	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ¬ 𝑧 ∈ 𝑦)
47	43, 46	eldifd 3031	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑧 ∈ (V ∖ 𝑦))
48		simplr 500	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑗 ∈ ω)
49		simprl 501	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑦 ≈ 𝑗)
50		fiunsnnn 6704	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ 𝑧 ∈ (V ∖ 𝑦)) ∧ (𝑗 ∈ ω ∧ 𝑦 ≈ 𝑗)) → (𝑦 ∪ {𝑧}) ≈ suc 𝑗)
51	41, 47, 48, 49, 50	syl22anc 1185	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝑦 ∪ {𝑧}) ≈ suc 𝑗)
52		hashunlem.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ Fin)
53	52	ad4antr 481	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝐴 ∈ Fin)
54		simprl 501	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) → 𝑦 ⊆ 𝐵)
55	54	ad2antrr 475	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑦 ⊆ 𝐵)
56		hashunlem.disj	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
57	56	ad4antr 481	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∩ 𝐵) = ∅)
58		incom 3215	. . . . . . . . . . . 12 ⊢ (𝑦 ∩ 𝐴) = (𝐴 ∩ 𝑦)
59		incom 3215	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
60	59	eqeq1i 2107	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)
61		ssdisj 3366	. . . . . . . . . . . . 13 ⊢ ((𝑦 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐴) = ∅) → (𝑦 ∩ 𝐴) = ∅)
62	60, 61	sylan2b 283	. . . . . . . . . . . 12 ⊢ ((𝑦 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝑦 ∩ 𝐴) = ∅)
63	58, 62	syl5eqr 2146	. . . . . . . . . . 11 ⊢ ((𝑦 ⊆ 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐴 ∩ 𝑦) = ∅)
64	55, 57, 63	syl2anc 406	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∩ 𝑦) = ∅)
65		unfidisj 6739	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin ∧ 𝑦 ∈ Fin ∧ (𝐴 ∩ 𝑦) = ∅) → (𝐴 ∪ 𝑦) ∈ Fin)
66	53, 41, 64, 65	syl3anc 1184	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∪ 𝑦) ∈ Fin)
67	45	eldifad 3032	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑧 ∈ 𝐵)
68		minel 3371	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ¬ 𝑧 ∈ 𝐴)
69	67, 57, 68	syl2anc 406	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ¬ 𝑧 ∈ 𝐴)
70		ioran 710	. . . . . . . . . . . 12 ⊢ (¬ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝑦) ↔ (¬ 𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝑦))
71		elun 3164	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝐴 ∪ 𝑦) ↔ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝑦))
72	70, 71	xchnxbir 647	. . . . . . . . . . 11 ⊢ (¬ 𝑧 ∈ (𝐴 ∪ 𝑦) ↔ (¬ 𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝑦))
73	69, 46, 72	sylanbrc 411	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ¬ 𝑧 ∈ (𝐴 ∪ 𝑦))
74	43, 73	eldifd 3031	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑧 ∈ (V ∖ (𝐴 ∪ 𝑦)))
75	29	ad4antr 481	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → 𝑁 ∈ ω)
76		nnacl 6306	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ω ∧ 𝑗 ∈ ω) → (𝑁 +o 𝑗) ∈ ω)
77	75, 48, 76	syl2anc 406	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝑁 +o 𝑗) ∈ ω)
78		simprr 502	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))
79		fiunsnnn 6704	. . . . . . . . 9 ⊢ ((((𝐴 ∪ 𝑦) ∈ Fin ∧ 𝑧 ∈ (V ∖ (𝐴 ∪ 𝑦))) ∧ ((𝑁 +o 𝑗) ∈ ω ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ((𝐴 ∪ 𝑦) ∪ {𝑧}) ≈ suc (𝑁 +o 𝑗))
80	66, 74, 77, 78, 79	syl22anc 1185	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ((𝐴 ∪ 𝑦) ∪ {𝑧}) ≈ suc (𝑁 +o 𝑗))
81		unass 3180	. . . . . . . . . 10 ⊢ ((𝐴 ∪ 𝑦) ∪ {𝑧}) = (𝐴 ∪ (𝑦 ∪ {𝑧}))
82	81	a1i 9	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ((𝐴 ∪ 𝑦) ∪ {𝑧}) = (𝐴 ∪ (𝑦 ∪ {𝑧})))
83	82	eqcomd 2105	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∪ (𝑦 ∪ {𝑧})) = ((𝐴 ∪ 𝑦) ∪ {𝑧}))
84		nnasuc 6302	. . . . . . . . 9 ⊢ ((𝑁 ∈ ω ∧ 𝑗 ∈ ω) → (𝑁 +o suc 𝑗) = suc (𝑁 +o 𝑗))
85	75, 48, 84	syl2anc 406	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝑁 +o suc 𝑗) = suc (𝑁 +o 𝑗))
86	80, 83, 85	3brtr4d 3905	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o suc 𝑗))
87		breq2 3879	. . . . . . . . 9 ⊢ (𝑘 = suc 𝑗 → ((𝑦 ∪ {𝑧}) ≈ 𝑘 ↔ (𝑦 ∪ {𝑧}) ≈ suc 𝑗))
88		oveq2 5714	. . . . . . . . . 10 ⊢ (𝑘 = suc 𝑗 → (𝑁 +o 𝑘) = (𝑁 +o suc 𝑗))
89	88	breq2d 3887	. . . . . . . . 9 ⊢ (𝑘 = suc 𝑗 → ((𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘) ↔ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o suc 𝑗)))
90	87, 89	anbi12d 460	. . . . . . . 8 ⊢ (𝑘 = suc 𝑗 → (((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘)) ↔ ((𝑦 ∪ {𝑧}) ≈ suc 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o suc 𝑗))))
91	90	rspcev 2744	. . . . . . 7 ⊢ ((suc 𝑗 ∈ ω ∧ ((𝑦 ∪ {𝑧}) ≈ suc 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o suc 𝑗))) → ∃𝑘 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘)))
92	40, 51, 86, 91	syl12anc 1182	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) ∧ (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗))) → ∃𝑘 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘)))
93	92	ex 114	. . . . 5 ⊢ ((((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) ∧ 𝑗 ∈ ω) → ((𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗)) → ∃𝑘 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘))))
94	93	rexlimdva 2508	. . . 4 ⊢ (((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) → (∃𝑗 ∈ ω (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗)) → ∃𝑘 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘))))
95		breq2 3879	. . . . . 6 ⊢ (𝑗 = 𝑘 → ((𝑦 ∪ {𝑧}) ≈ 𝑗 ↔ (𝑦 ∪ {𝑧}) ≈ 𝑘))
96		oveq2 5714	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑁 +o 𝑗) = (𝑁 +o 𝑘))
97	96	breq2d 3887	. . . . . 6 ⊢ (𝑗 = 𝑘 → ((𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗) ↔ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘)))
98	95, 97	anbi12d 460	. . . . 5 ⊢ (𝑗 = 𝑘 → (((𝑦 ∪ {𝑧}) ≈ 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗)) ↔ ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘))))
99	98	cbvrexv 2613	. . . 4 ⊢ (∃𝑗 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗)) ↔ ∃𝑘 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑘 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑘)))
100	94, 99	syl6ibr 161	. . 3 ⊢ (((𝜑 ∧ 𝑦 ∈ Fin) ∧ (𝑦 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑦))) → (∃𝑗 ∈ ω (𝑦 ≈ 𝑗 ∧ (𝐴 ∪ 𝑦) ≈ (𝑁 +o 𝑗)) → ∃𝑗 ∈ ω ((𝑦 ∪ {𝑧}) ≈ 𝑗 ∧ (𝐴 ∪ (𝑦 ∪ {𝑧})) ≈ (𝑁 +o 𝑗))))
101		hashunlem.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ Fin)
102	5, 10, 15, 20, 38, 100, 101	findcard2sd 6715	. 2 ⊢ (𝜑 → ∃𝑗 ∈ ω (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))
103		simprrr 510	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗))
104		hashunlem.bm	. . . . . . 7 ⊢ (𝜑 → 𝐵 ≈ 𝑀)
105	104	ensymd 6607	. . . . . 6 ⊢ (𝜑 → 𝑀 ≈ 𝐵)
106		simprrl 509	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → 𝐵 ≈ 𝑗)
107		entr 6608	. . . . . 6 ⊢ ((𝑀 ≈ 𝐵 ∧ 𝐵 ≈ 𝑗) → 𝑀 ≈ 𝑗)
108	105, 106, 107	syl2an2r 565	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → 𝑀 ≈ 𝑗)
109		hashunlem.m	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ω)
110		simprl 501	. . . . . 6 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → 𝑗 ∈ ω)
111		nneneq 6680	. . . . . 6 ⊢ ((𝑀 ∈ ω ∧ 𝑗 ∈ ω) → (𝑀 ≈ 𝑗 ↔ 𝑀 = 𝑗))
112	109, 110, 111	syl2an2r 565	. . . . 5 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → (𝑀 ≈ 𝑗 ↔ 𝑀 = 𝑗))
113	108, 112	mpbid 146	. . . 4 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → 𝑀 = 𝑗)
114	113	oveq2d 5722	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → (𝑁 +o 𝑀) = (𝑁 +o 𝑗))
115	103, 114	breqtrrd 3901	. 2 ⊢ ((𝜑 ∧ (𝑗 ∈ ω ∧ (𝐵 ≈ 𝑗 ∧ (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑗)))) → (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑀))
116	102, 115	rexlimddv 2513	1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ≈ (𝑁 +o 𝑀))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 670   = wceq 1299   ∈ wcel 1448  ∃wrex 2376  Vcvv 2641   ∖ cdif 3018   ∪ cun 3019   ∩ cin 3020   ⊆ wss 3021  ∅c0 3310  {csn 3474   class class class wbr 3875  suc csuc 4225  ωcom 4442  (class class class)co 5706   +_o coa 6240   ≈ cen 6562  Fincfn 6564

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 584  ax-in2 585  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-coll 3983  ax-sep 3986  ax-nul 3994  ax-pow 4038  ax-pr 4069  ax-un 4293  ax-setind 4390  ax-iinf 4440

This theorem depends on definitions:  df-bi 116  df-dc 787  df-3or 931  df-3an 932  df-tru 1302  df-fal 1305  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ne 2268  df-ral 2380  df-rex 2381  df-reu 2382  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-dif 3023  df-un 3025  df-in 3027  df-ss 3034  df-nul 3311  df-if 3422  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-int 3719  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-tr 3967  df-id 4153  df-iord 4226  df-on 4228  df-suc 4231  df-iom 4443  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-ov 5709  df-oprab 5710  df-mpo 5711  df-1st 5969  df-2nd 5970  df-recs 6132  df-irdg 6197  df-1o 6243  df-oadd 6247  df-er 6359  df-en 6565  df-fin 6567

This theorem is referenced by:  hashun  10392