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

Theorem marypha2lem2 9395
Description: Lemma for marypha2 9398. 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 4604 . . . 4 (𝑥 = 𝑧 → {𝑥} = {𝑧})
3 fveq2 6882 . . . 4 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
42, 3xpeq12d 5693 . . 3 (𝑥 = 𝑧 → ({𝑥} × (𝐹𝑥)) = ({𝑧} × (𝐹𝑧)))
54cbviunv 5007 . 2 𝑥𝐴 ({𝑥} × (𝐹𝑥)) = 𝑧𝐴 ({𝑧} × (𝐹𝑧))
6 df-xp 5668 . . . . 5 ({𝑧} × (𝐹𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))}
76a1i 11 . . . 4 (𝑧𝐴 → ({𝑧} × (𝐹𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))})
87iuneq2i 4982 . . 3 𝑧𝐴 ({𝑧} × (𝐹𝑧)) = 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))}
9 iunopab 5545 . . 3 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))}
10 velsn 4610 . . . . . . . 8 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
11 equcom 2045 . . . . . . . 8 (𝑥 = 𝑧𝑧 = 𝑥)
1210, 11bitri 278 . . . . . . 7 (𝑥 ∈ {𝑧} ↔ 𝑧 = 𝑥)
1312anbi1i 635 . . . . . 6 ((𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧)) ↔ (𝑧 = 𝑥𝑦 ∈ (𝐹𝑧)))
1413rexbii 3118 . . . . 5 (∃𝑧𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧)) ↔ ∃𝑧𝐴 (𝑧 = 𝑥𝑦 ∈ (𝐹𝑧)))
15 fveq2 6882 . . . . . . 7 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
1615eleq2d 2855 . . . . . 6 (𝑧 = 𝑥 → (𝑦 ∈ (𝐹𝑧) ↔ 𝑦 ∈ (𝐹𝑥)))
1716ceqsrexbv 3624 . . . . 5 (∃𝑧𝐴 (𝑧 = 𝑥𝑦 ∈ (𝐹𝑧)) ↔ (𝑥𝐴𝑦 ∈ (𝐹𝑥)))
1814, 17bitri 278 . . . 4 (∃𝑧𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧)) ↔ (𝑥𝐴𝑦 ∈ (𝐹𝑥)))
1918opabbii 5182 . . 3 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 (𝑥 ∈ {𝑧} ∧ 𝑦 ∈ (𝐹𝑧))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))}
208, 9, 193eqtri 2796 . 2 𝑧𝐴 ({𝑧} × (𝐹𝑧)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))}
211, 5, 203eqtri 2796 1 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))}
Colors of variables: wff setvar class
Syntax hints:  wa 400   = wceq 1567  wcel 2149  wrex 3095  {csn 4594   ciun 4960  {copab 5177   × cxp 5660  cfv 6537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-11 2198  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-xp 5668  df-iota 6493  df-fv 6545
This theorem is referenced by:  marypha2lem3  9396  marypha2lem4  9397  eulerpartlemgu  34711
  Copyright terms: Public domain W3C validator