Theorem hfun 33248

Description: The union of two HF sets is an HF set. (Contributed by Scott Fenton, 15-Jul-2015.)

Assertion

Ref	Expression
hfun	⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 ∪ 𝐵) ∈ Hf )

Proof of Theorem hfun

Step	Hyp	Ref	Expression
1		rankung 33236	. . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))
2		elhf2g 33246	. . . . 5 ⊢ (𝐴 ∈ Hf → (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω))
3	2	ibi 268	. . . 4 ⊢ (𝐴 ∈ Hf → (rank‘𝐴) ∈ ω)
4		elhf2g 33246	. . . . 5 ⊢ (𝐵 ∈ Hf → (𝐵 ∈ Hf ↔ (rank‘𝐵) ∈ ω))
5	4	ibi 268	. . . 4 ⊢ (𝐵 ∈ Hf → (rank‘𝐵) ∈ ω)
6		eleq1a 2878	. . . . . 6 ⊢ ((rank‘𝐵) ∈ ω → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
7	6	adantl 482	. . . . 5 ⊢ (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
8		uncom 4050	. . . . . . . . . 10 ⊢ ((rank‘𝐵) ∪ (rank‘𝐴)) = ((rank‘𝐴) ∪ (rank‘𝐵))
9	8	eqeq1i 2800	. . . . . . . . 9 ⊢ (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) ↔ ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐴))
10	9	biimpi 217	. . . . . . . 8 ⊢ (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐴))
11	10	eleq1d 2867	. . . . . . 7 ⊢ (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω ↔ (rank‘𝐴) ∈ ω))
12	11	biimprcd 251	. . . . . 6 ⊢ ((rank‘𝐴) ∈ ω → (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
13	12	adantr 481	. . . . 5 ⊢ (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
14		nnord 7444	. . . . . . 7 ⊢ ((rank‘𝐴) ∈ ω → Ord (rank‘𝐴))
15		nnord 7444	. . . . . . 7 ⊢ ((rank‘𝐵) ∈ ω → Ord (rank‘𝐵))
16		ordtri2or2 6162	. . . . . . 7 ⊢ ((Ord (rank‘𝐴) ∧ Ord (rank‘𝐵)) → ((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)))
17	14, 15, 16	syl2an 595	. . . . . 6 ⊢ (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → ((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)))
18		ssequn1 4077	. . . . . . 7 ⊢ ((rank‘𝐴) ⊆ (rank‘𝐵) ↔ ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵))
19		ssequn1 4077	. . . . . . 7 ⊢ ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴))
20	18, 19	orbi12i 909	. . . . . 6 ⊢ (((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)) ↔ (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) ∨ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴)))
21	17, 20	sylib 219	. . . . 5 ⊢ (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) ∨ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴)))
22	7, 13, 21	mpjaod 855	. . . 4 ⊢ (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω)
23	3, 5, 22	syl2an 595	. . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω)
24	1, 23	eqeltrd 2883	. 2 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (rank‘(𝐴 ∪ 𝐵)) ∈ ω)
25		unexg 7329	. . 3 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 ∪ 𝐵) ∈ V)
26		elhf2g 33246	. . 3 ⊢ ((𝐴 ∪ 𝐵) ∈ V → ((𝐴 ∪ 𝐵) ∈ Hf ↔ (rank‘(𝐴 ∪ 𝐵)) ∈ ω))
27	25, 26	syl 17	. 2 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → ((𝐴 ∪ 𝐵) ∈ Hf ↔ (rank‘(𝐴 ∪ 𝐵)) ∈ ω))
28	24, 27	mpbird 258	1 ⊢ ((𝐴 ∈ Hf ∧ 𝐵 ∈ Hf ) → (𝐴 ∪ 𝐵) ∈ Hf )

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 842   = wceq 1522   ∈ wcel 2081  Vcvv 3437   ∪ cun 3857   ⊆ wss 3859  Ord word 6065  ‘cfv 6225  ωcom 7436  rankcrnk 9038   Hf chf 33242

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221  ax-un 7319  ax-reg 8902  ax-inf2 8950

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-pss 3876  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-tp 4477  df-op 4479  df-uni 4746  df-int 4783  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-tr 5064  df-id 5348  df-eprel 5353  df-po 5362  df-so 5363  df-fr 5402  df-we 5404  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-pred 6023  df-ord 6069  df-on 6070  df-lim 6071  df-suc 6072  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-om 7437  df-wrecs 7798  df-recs 7860  df-rdg 7898  df-er 8139  df-en 8358  df-dom 8359  df-sdom 8360  df-r1 9039  df-rank 9040  df-hf 33243

This theorem is referenced by:  hfadj  33250