Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > unielrel | Structured version Visualization version GIF version |
Description: The membership relation for a relation is inherited by class union. (Contributed by NM, 17-Sep-2006.) |
Ref | Expression |
---|---|
unielrel | ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∪ 𝐴 ∈ ∪ 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elrel 5740 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
2 | simpr 485 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → 𝐴 ∈ 𝑅) | |
3 | vex 3445 | . . . . . 6 ⊢ 𝑥 ∈ V | |
4 | vex 3445 | . . . . . 6 ⊢ 𝑦 ∈ V | |
5 | 3, 4 | uniopel 5460 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ 𝑅 → ∪ 〈𝑥, 𝑦〉 ∈ ∪ 𝑅) |
6 | 5 | a1i 11 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (〈𝑥, 𝑦〉 ∈ 𝑅 → ∪ 〈𝑥, 𝑦〉 ∈ ∪ 𝑅)) |
7 | eleq1 2824 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝑅 ↔ 〈𝑥, 𝑦〉 ∈ 𝑅)) | |
8 | unieq 4863 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 = ∪ 〈𝑥, 𝑦〉) | |
9 | 8 | eleq1d 2821 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (∪ 𝐴 ∈ ∪ 𝑅 ↔ ∪ 〈𝑥, 𝑦〉 ∈ ∪ 𝑅)) |
10 | 6, 7, 9 | 3imtr4d 293 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅)) |
11 | 10 | exlimivv 1934 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 → (𝐴 ∈ 𝑅 → ∪ 𝐴 ∈ ∪ 𝑅)) |
12 | 1, 2, 11 | sylc 65 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∪ 𝐴 ∈ ∪ 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1540 ∃wex 1780 ∈ wcel 2105 〈cop 4579 ∪ cuni 4852 Rel wrel 5625 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2707 ax-sep 5243 ax-nul 5250 ax-pr 5372 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-v 3443 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4270 df-if 4474 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-opab 5155 df-xp 5626 df-rel 5627 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |