MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  marypha2lem2 Structured version   Visualization version   GIF version

Theorem marypha2lem2 9465
Description: Lemma for marypha2 9468. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
Hypothesis
Ref Expression
marypha2lem.t 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
Assertion
Ref Expression
marypha2lem2 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐹,𝑦
Allowed substitution hints:   𝑇(𝑥, 𝑦)

Proof of Theorem marypha2lem2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 marypha2lem.t . 2 𝑇 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥))
2 sneq 4594 . . . 4 (𝑥 = 𝑧 → {𝑥} = {𝑧})
3 fveq2 6916 . . . 4 (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
42, 3xpeq12d 5689 . . 3 (𝑥 = 𝑧 → ({𝑥} × (𝐹‘𝑥)) = ({𝑧} × (𝐹‘𝑧)))
54cbviunv 5002 . 2 ∪ 𝑥 ∈ 𝐴 ({𝑥} × (𝐹‘𝑥)) = ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧))
6 df-xp 5664 . . . . 5 ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
76a1i 11 . . . 4 (𝑧 ∈ 𝐴 → ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))})
87iuneq2i 4978 . . 3 ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
9 iunopab 5541 . . 3 ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))}
10 velsn 4600 . . . . . . . 8 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
11 equcom 2053 . . . . . . . 8 (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
1210, 11bitri 278 . . . . . . 7 (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
1312anbi1i 636 . . . . . 6 ((𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
1413rexbii 3113 . . . . 5 (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ ∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)))
15 fveq2 6916 . . . . . . 7 (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
1615eleq2d 2850 . . . . . 6 (𝑧 = 𝑥 → (𝑦 ∈ (𝐹‘𝑧) ↔ 𝑦 ∈ (𝐹‘𝑥)))
1716ceqsrexbv 3613 . . . . 5 (∃𝑧 ∈ 𝐴 (𝑧 = 𝑥 ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
1814, 17bitri 278 . . . 4 (∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥)))
1918opabbii 5178 . . 3 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹‘𝑧))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
208, 9, 193eqtri 2790 . 2 ∪ 𝑧 ∈ 𝐴 ({𝑧} × (𝐹‘𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
211, 5, 203eqtri 2790 1 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ (𝐹‘𝑥))}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {csn 4588  ∪ ciun 4956  {copab 5173   × cxp 5656  ‘cfv 6566
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-11 2197  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-xp 5664  df-iota 6520  df-fv 6574
This theorem is used by:  marypha2lem3  9466  marypha2lem4  9467  eulerpartlemgu  35120
  Copyright terms: Public domain W3C validator