Theorem unhe1 44770

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 44758	. . 3 ⊢ (𝑅 hereditary 𝐴 ↔ (𝑅 “ 𝐴) ⊆ 𝐴)
2		df-he 44758	. . 3 ⊢ (𝑆 hereditary 𝐴 ↔ (𝑆 “ 𝐴) ⊆ 𝐴)
3		imaundir 6142	. . . 4 ⊢ ((𝑅 ∪ 𝑆) “ 𝐴) = ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴))
4		unss 4136	. . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) ↔ ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴)) ⊆ 𝐴)
5	4	biimpi 219	. . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) → ((𝑅 “ 𝐴) ∪ (𝑆 “ 𝐴)) ⊆ 𝐴)
6	3, 5	eqsstrid 3969	. . 3 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ (𝑆 “ 𝐴) ⊆ 𝐴) → ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
7	1, 2, 6	syl2anb 610	. 2 ⊢ ((𝑅 hereditary 𝐴 ∧ 𝑆 hereditary 𝐴) → ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
8		df-he 44758	. 2 ⊢ ((𝑅 ∪ 𝑆) hereditary 𝐴 ↔ ((𝑅 ∪ 𝑆) “ 𝐴) ⊆ 𝐴)
9	7, 8	sylibr 237	1 ⊢ ((𝑅 hereditary 𝐴 ∧ 𝑆 hereditary 𝐴) → (𝑅 ∪ 𝑆) hereditary 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∪ cun 3897   ⊆ wss 3899   “ cima 5654   hereditary whe 44757

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-he 44758

This theorem is used by:  sshepw  44774