Theorem unielrel 6300

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 5783	. 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2		simpr 490	. 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → 𝐴 ∈ 𝑅)
3		vex 3458	. . . . . 6 ⊢ 𝑥 ∈ V
4		vex 3458	. . . . . 6 ⊢ 𝑦 ∈ V
5	3, 4	uniopel 5496	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅)
6	5	a1i 11	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅))
7		eleq1 2852	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
8		unieq 4883	. . . . 5 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∪ 𝐴 = ∪ ⟨𝑥, 𝑦⟩)
9	8	eleq1d 2849	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (∪ 𝐴 ∈ ∪ 𝑅 ↔ ∪ ⟨𝑥, 𝑦⟩ ∈ ∪ 𝑅))
10	6, 7, 9	3imtr4d 297	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅))
11	10	exlimivv 1967	. 2 ⊢ (∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅))
12	1, 2, 11	sylc 66	1 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∪ 𝐴 ∈ ∪ 𝑅)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ⟨cop 4840  ∪ cuni 4872  Rel wrel 5663

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  ax-sep 5255  ax-pr 5398

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-ral 3081  df-rex 3091  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-uni 4873  df-opab 5174  df-xp 5664  df-rel 5665

This theorem is used by: (None)