Theorem unielrel 5660

Description: The membership relation for a relation is inherited by class union. (Contributed by NM, 17-Sep-2006.)

Assertion

Ref	Expression
unielrel	⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∪ 𝐴 ∈ ∪ 𝑅)

Proof of Theorem unielrel

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elrel 5222	. 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2		simpr 477	. 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → 𝐴 ∈ 𝑅)
3		vex 3203	. . . . . 6 ⊢ 𝑥 ∈ V
4		vex 3203	. . . . . 6 ⊢ 𝑦 ∈ V
5	3, 4	uniopel 4978	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅)
6	5	a1i 11	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅))
7		eleq1 2689	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
8		unieq 4444	. . . . 5 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∪ 𝐴 = ∪ ⟨𝑥, 𝑦⟩)
9	8	eleq1d 2686	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (∪ 𝐴 ∈ ∪ 𝑅 ↔ ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅))
10	6, 7, 9	3imtr4d 283	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅))
11	10	exlimivv 1860	. 2 ⊢ (∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅))
12	1, 2, 11	sylc 65	1 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∪ 𝐴 ∈ ∪ 𝑅)

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483  ∃wex 1704   ∈ wcel 1990  ⟨cop 4183  ∪ cuni 4436  Rel wrel 5119

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-opab 4713  df-xp 5120  df-rel 5121

This theorem is referenced by: (None)