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

Theorem fmucndlem 24316
Description: Lemma for fmucnd 24317. (Contributed by Thierry Arnoux, 19-Nov-2017.)
Assertion
Ref Expression
fmucndlem ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹𝐴) × (𝐹𝐴)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦

Proof of Theorem fmucndlem
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 df-ima 5702 . . 3 ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴))
2 simpr 484 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → 𝐴𝑋)
3 resmpo 7553 . . . . 5 ((𝐴𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
42, 3sylancom 588 . . . 4 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
54rneqd 5952 . . 3 ((𝐹 Fn 𝑋𝐴𝑋) → ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
61, 5eqtrid 2787 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
7 vex 3482 . . . . . . . . . . . . 13 𝑥 ∈ V
8 vex 3482 . . . . . . . . . . . . 13 𝑦 ∈ V
97, 8op1std 8023 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (1st𝑝) = 𝑥)
109fveq2d 6911 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(1st𝑝)) = (𝐹𝑥))
117, 8op2ndd 8024 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (2nd𝑝) = 𝑦)
1211fveq2d 6911 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(2nd𝑝)) = (𝐹𝑦))
1310, 12opeq12d 4886 . . . . . . . . . 10 (𝑝 = ⟨𝑥, 𝑦⟩ → ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1413mpompt 7547 . . . . . . . . 9 (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1514eqcomi 2744 . . . . . . . 8 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
1615rneqi 5951 . . . . . . 7 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ran (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
17 fvexd 6922 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(1st𝑝)) ∈ V)
18 fvexd 6922 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(2nd𝑝)) ∈ V)
1916, 17, 18fliftrel 7328 . . . . . 6 (⊤ → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V))
2019mptru 1544 . . . . 5 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V)
2120sseli 3991 . . . 4 (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) → 𝑝 ∈ (V × V))
2221adantl 481 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)) → 𝑝 ∈ (V × V))
23 xpss 5705 . . . . 5 ((𝐹𝐴) × (𝐹𝐴)) ⊆ (V × V)
2423sseli 3991 . . . 4 (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) → 𝑝 ∈ (V × V))
2524adantl 481 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))) → 𝑝 ∈ (V × V))
26 eqid 2735 . . . . . . . . 9 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
27 opex 5475 . . . . . . . . 9 ⟨(𝐹𝑥), (𝐹𝑦)⟩ ∈ V
2826, 27elrnmpo 7569 . . . . . . . 8 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
29 eqcom 2742 . . . . . . . . . 10 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩)
30 fvex 6920 . . . . . . . . . . 11 (1st𝑝) ∈ V
31 fvex 6920 . . . . . . . . . . 11 (2nd𝑝) ∈ V
3230, 31opth2 5491 . . . . . . . . . 10 (⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
3329, 32bitri 275 . . . . . . . . 9 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
34332rexbii 3127 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
35 reeanv 3227 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
3628, 34, 353bitri 297 . . . . . . 7 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
37 fvelimab 6981 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((1st𝑝) ∈ (𝐹𝐴) ↔ ∃𝑥𝐴 (𝐹𝑥) = (1st𝑝)))
38 fvelimab 6981 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((2nd𝑝) ∈ (𝐹𝐴) ↔ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
3937, 38anbi12d 632 . . . . . . 7 ((𝐹 Fn 𝑋𝐴𝑋) → (((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝))))
4036, 39bitr4id 290 . . . . . 6 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴))))
41 opelxp 5725 . . . . . 6 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)))
4240, 41bitr4di 289 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4342adantr 480 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
44 1st2nd2 8052 . . . . . 6 (𝑝 ∈ (V × V) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4544adantl 481 . . . . 5 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4645eleq1d 2824 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)))
4745eleq1d 2824 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4843, 46, 473bitr4d 311 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))))
4922, 25, 48eqrdav 2734 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ((𝐹𝐴) × (𝐹𝐴)))
506, 49eqtrd 2775 1 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹𝐴) × (𝐹𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wtru 1538  wcel 2106  wrex 3068  Vcvv 3478  wss 3963  cop 4637  cmpt 5231   × cxp 5687  ran crn 5690  cres 5691  cima 5692   Fn wfn 6558  cfv 6563  cmpo 7433  1st c1st 8011  2nd c2nd 8012
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-fv 6571  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014
This theorem is referenced by:  fmucnd  24317
  Copyright terms: Public domain W3C validator