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

Theorem marypha2lem4 8890
 Description: Lemma for marypha2 8891. Properties of the used relation. (Contributed by Stefan O'Rear, 20-Feb-2015.)
Hypothesis
Ref Expression
marypha2lem.t 𝑇 = 𝑥𝐴 ({𝑥} × (𝐹𝑥))
Assertion
Ref Expression
marypha2lem4 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑇𝑋) = (𝐹𝑋))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑋
Allowed substitution hint:   𝑇(𝑥)

Proof of Theorem marypha2lem4
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 marypha2lem.t . . . . . 6 𝑇 = 𝑥𝐴 ({𝑥} × (𝐹𝑥))
21marypha2lem2 8888 . . . . 5 𝑇 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))}
32imaeq1i 5897 . . . 4 (𝑇𝑋) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} “ 𝑋)
4 df-ima 5536 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} “ 𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋)
53, 4eqtri 2824 . . 3 (𝑇𝑋) = ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋)
6 resopab2 5875 . . . . . 6 (𝑋𝐴 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦 ∈ (𝐹𝑥))})
76adantl 485 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦 ∈ (𝐹𝑥))})
87rneqd 5776 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋) = ran {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦 ∈ (𝐹𝑥))})
9 rnopab 5794 . . . . 5 ran {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦 ∈ (𝐹𝑥))} = {𝑦 ∣ ∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥))}
10 df-rex 3115 . . . . . . . . 9 (∃𝑥𝑋 𝑦 ∈ (𝐹𝑥) ↔ ∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥)))
1110bicomi 227 . . . . . . . 8 (∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥)) ↔ ∃𝑥𝑋 𝑦 ∈ (𝐹𝑥))
1211abbii 2866 . . . . . . 7 {𝑦 ∣ ∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥))} = {𝑦 ∣ ∃𝑥𝑋 𝑦 ∈ (𝐹𝑥)}
13 df-iun 4886 . . . . . . 7 𝑥𝑋 (𝐹𝑥) = {𝑦 ∣ ∃𝑥𝑋 𝑦 ∈ (𝐹𝑥)}
1412, 13eqtr4i 2827 . . . . . 6 {𝑦 ∣ ∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥))} = 𝑥𝑋 (𝐹𝑥)
1514a1i 11 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → {𝑦 ∣ ∃𝑥(𝑥𝑋𝑦 ∈ (𝐹𝑥))} = 𝑥𝑋 (𝐹𝑥))
169, 15syl5eq 2848 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥𝑋𝑦 ∈ (𝐹𝑥))} = 𝑥𝑋 (𝐹𝑥))
178, 16eqtrd 2836 . . 3 ((𝐹 Fn 𝐴𝑋𝐴) → ran ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐹𝑥))} ↾ 𝑋) = 𝑥𝑋 (𝐹𝑥))
185, 17syl5eq 2848 . 2 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑇𝑋) = 𝑥𝑋 (𝐹𝑥))
19 fnfun 6427 . . . 4 (𝐹 Fn 𝐴 → Fun 𝐹)
2019adantr 484 . . 3 ((𝐹 Fn 𝐴𝑋𝐴) → Fun 𝐹)
21 funiunfv 6989 . . 3 (Fun 𝐹 𝑥𝑋 (𝐹𝑥) = (𝐹𝑋))
2220, 21syl 17 . 2 ((𝐹 Fn 𝐴𝑋𝐴) → 𝑥𝑋 (𝐹𝑥) = (𝐹𝑋))
2318, 22eqtrd 2836 1 ((𝐹 Fn 𝐴𝑋𝐴) → (𝑇𝑋) = (𝐹𝑋))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538  ∃wex 1781   ∈ wcel 2112  {cab 2779  ∃wrex 3110   ⊆ wss 3884  {csn 4528  ∪ cuni 4803  ∪ ciun 4884  {copab 5095   × cxp 5521  ran crn 5524   ↾ cres 5525   “ cima 5526  Fun wfun 6322   Fn wfn 6323  ‘cfv 6328 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-fv 6336 This theorem is referenced by:  marypha2  8891
 Copyright terms: Public domain W3C validator