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

Theorem hfunOLD 9943
Description: Obsolete version of hfun 9942 as of 17-Sep-2026. (Contributed by Scott Fenton, 15-Jul-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
hfunOLD ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (𝐴 ∪ 𝐵) ∈ HF )

Proof of Theorem hfunOLD
StepHypRef Expression
1 rankung 9897 . . 3 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (rank‘(𝐴 ∪ 𝐵)) = ((rank‘𝐴) ∪ (rank‘𝐵)))
2 elhf2g 9935 . . . . 5 (𝐴 ∈ HF → (𝐴 ∈ HF ↔ (rank‘𝐴) ∈ ω))
32ibi 270 . . . 4 (𝐴 ∈ HF → (rank‘𝐴) ∈ ω)
4 elhf2g 9935 . . . . 5 (𝐵 ∈ HF → (𝐵 ∈ HF ↔ (rank‘𝐵) ∈ ω))
54ibi 270 . . . 4 (𝐵 ∈ HF → (rank‘𝐵) ∈ ω)
6 eleq1a 2859 . . . . . 6 ((rank‘𝐵) ∈ ω → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
76adantl 487 . . . . 5 (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
8 uncom 4160 . . . . . . . . . 10 ((rank‘𝐵) ∪ (rank‘𝐴)) = ((rank‘𝐴) ∪ (rank‘𝐵))
98eqeq1i 2768 . . . . . . . . 9 (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) ↔ ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐴))
109biimpi 219 . . . . . . . 8 (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐴))
1110eleq1d 2849 . . . . . . 7 (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → (((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω ↔ (rank‘𝐴) ∈ ω))
1211biimprcd 253 . . . . . 6 ((rank‘𝐴) ∈ ω → (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
1312adantr 486 . . . . 5 (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω))
14 nnord 7906 . . . . . . 7 ((rank‘𝐴) ∈ ω → Ord (rank‘𝐴))
15 nnord 7906 . . . . . . 7 ((rank‘𝐵) ∈ ω → Ord (rank‘𝐵))
16 ordtri2or2 6479 . . . . . . 7 ((Ord (rank‘𝐴) ∧ Ord (rank‘𝐵)) → ((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)))
1714, 15, 16syl2an 608 . . . . . 6 (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → ((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)))
18 ssequn1 4187 . . . . . . 7 ((rank‘𝐴) ⊆ (rank‘𝐵) ↔ ((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵))
19 ssequn1 4187 . . . . . . 7 ((rank‘𝐵) ⊆ (rank‘𝐴) ↔ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴))
2018, 19orbi12i 928 . . . . . 6 (((rank‘𝐴) ⊆ (rank‘𝐵) ∨ (rank‘𝐵) ⊆ (rank‘𝐴)) ↔ (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) ∨ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴)))
2117, 20sylib 221 . . . . 5 (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → (((rank‘𝐴) ∪ (rank‘𝐵)) = (rank‘𝐵) ∨ ((rank‘𝐵) ∪ (rank‘𝐴)) = (rank‘𝐴)))
227, 13, 21mpjaod 874 . . . 4 (((rank‘𝐴) ∈ ω ∧ (rank‘𝐵) ∈ ω) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω)
233, 5, 22syl2an 608 . . 3 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → ((rank‘𝐴) ∪ (rank‘𝐵)) ∈ ω)
241, 23eqeltrd 2864 . 2 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (rank‘(𝐴 ∪ 𝐵)) ∈ ω)
25 unexg 7781 . . 3 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (𝐴 ∪ 𝐵) ∈ V)
26 elhf2g 9935 . . 3 ((𝐴 ∪ 𝐵) ∈ V → ((𝐴 ∪ 𝐵) ∈ HF ↔ (rank‘(𝐴 ∪ 𝐵)) ∈ ω))
2725, 26syl 18 . 2 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → ((𝐴 ∪ 𝐵) ∈ HF ↔ (rank‘(𝐴 ∪ 𝐵)) ∈ ω))
2824, 27mpbird 260 1 ((𝐴 ∈ HF ∧ 𝐵 ∈ HF ) → (𝐴 ∪ 𝐵) ∈ HF )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  Ord word 6376  ‘cfv 6555  ωcom 7898  rankcrnk 9791   HF chf 9928
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-reg 9610  ax-inf2 9666
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-r1 9792  df-rank 9793  df-hf 9929
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator