Theorem unhe1 45046

Description: The union of two relations hereditary in a class is also hereditary in a class. (Contributed by RP, 28-Mar-2020.)

Assertion

Ref	Expression
unhe1	⊢ ((𝑅 hereditary 𝐴 ∧ 𝑆 hereditary 𝐴) → (𝑅 ∪ 𝑆) hereditary 𝐴)

Proof of Theorem unhe1

Step	Hyp	Ref	Expression
1		df-he 45034	. . 3 ⊢ (𝑅 hereditary 𝐴 ↔ (𝑅 “ 𝐴) ⊆ 𝐴)
2		df-he 45034	. . 3 ⊢ (𝑆 hereditary 𝐴 ↔ (𝑆 “ 𝐴) ⊆ 𝐴)
3		imaundir 6160	. . . 4 ⊢ ((𝑅 ∪ 𝑆) “ 𝐴) = ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴))
4		unss 4191	. . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) ↔ ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴)) ⊆ 𝐴)
5	4	biimpi 219	. . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) → ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴)) ⊆ 𝐴)
6	3, 5	eqsstrid 3951	. . 3 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) → ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
7	1, 2, 6	syl2anb 610	. 2 ⊢ ((𝑅 hereditary 𝐴 ∧ 𝑆 hereditary 𝐴) → ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
8		df-he 45034	. 2 ⊢ ((𝑅 ∪ 𝑆) hereditary 𝐴 ↔ ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
9	7, 8	sylibr 237	1 ⊢ ((𝑅 hereditary 𝐴 ∧ 𝑆 hereditary 𝐴) → (𝑅 ∪ 𝑆) hereditary 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ⊆ wss 3900   ∪ cun 4152   “ cima 5661   hereditary whe 45033

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-he 45034

This theorem is used by:  sshepw  45050