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

Theorem fmucndlem 23643
Description: Lemma for fmucnd 23644. (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 5646 . . 3 ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴))
2 simpr 485 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → 𝐴𝑋)
3 resmpo 7476 . . . . 5 ((𝐴𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
42, 3sylancom 588 . . . 4 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
54rneqd 5893 . . 3 ((𝐹 Fn 𝑋𝐴𝑋) → ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
61, 5eqtrid 2788 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
7 vex 3449 . . . . . . . . . . . . 13 𝑥 ∈ V
8 vex 3449 . . . . . . . . . . . . 13 𝑦 ∈ V
97, 8op1std 7931 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (1st𝑝) = 𝑥)
109fveq2d 6846 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(1st𝑝)) = (𝐹𝑥))
117, 8op2ndd 7932 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (2nd𝑝) = 𝑦)
1211fveq2d 6846 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(2nd𝑝)) = (𝐹𝑦))
1310, 12opeq12d 4838 . . . . . . . . . 10 (𝑝 = ⟨𝑥, 𝑦⟩ → ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1413mpompt 7470 . . . . . . . . 9 (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1514eqcomi 2745 . . . . . . . 8 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
1615rneqi 5892 . . . . . . 7 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ran (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
17 fvexd 6857 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(1st𝑝)) ∈ V)
18 fvexd 6857 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(2nd𝑝)) ∈ V)
1916, 17, 18fliftrel 7253 . . . . . 6 (⊤ → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V))
2019mptru 1548 . . . . 5 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V)
2120sseli 3940 . . . 4 (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) → 𝑝 ∈ (V × V))
2221adantl 482 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)) → 𝑝 ∈ (V × V))
23 xpss 5649 . . . . 5 ((𝐹𝐴) × (𝐹𝐴)) ⊆ (V × V)
2423sseli 3940 . . . 4 (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) → 𝑝 ∈ (V × V))
2524adantl 482 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))) → 𝑝 ∈ (V × V))
26 eqid 2736 . . . . . . . . 9 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
27 opex 5421 . . . . . . . . 9 ⟨(𝐹𝑥), (𝐹𝑦)⟩ ∈ V
2826, 27elrnmpo 7492 . . . . . . . 8 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
29 eqcom 2743 . . . . . . . . . 10 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩)
30 fvex 6855 . . . . . . . . . . 11 (1st𝑝) ∈ V
31 fvex 6855 . . . . . . . . . . 11 (2nd𝑝) ∈ V
3230, 31opth2 5437 . . . . . . . . . 10 (⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
3329, 32bitri 274 . . . . . . . . 9 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
34332rexbii 3128 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
35 reeanv 3217 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
3628, 34, 353bitri 296 . . . . . . 7 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
37 fvelimab 6914 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((1st𝑝) ∈ (𝐹𝐴) ↔ ∃𝑥𝐴 (𝐹𝑥) = (1st𝑝)))
38 fvelimab 6914 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((2nd𝑝) ∈ (𝐹𝐴) ↔ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
3937, 38anbi12d 631 . . . . . . 7 ((𝐹 Fn 𝑋𝐴𝑋) → (((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝))))
4036, 39bitr4id 289 . . . . . 6 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴))))
41 opelxp 5669 . . . . . 6 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)))
4240, 41bitr4di 288 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4342adantr 481 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
44 1st2nd2 7960 . . . . . 6 (𝑝 ∈ (V × V) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4544adantl 482 . . . . 5 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4645eleq1d 2822 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)))
4745eleq1d 2822 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4843, 46, 473bitr4d 310 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))))
4922, 25, 48eqrdav 2735 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ((𝐹𝐴) × (𝐹𝐴)))
506, 49eqtrd 2776 1 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹𝐴) × (𝐹𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wtru 1542  wcel 2106  wrex 3073  Vcvv 3445  wss 3910  cop 4592  cmpt 5188   × cxp 5631  ran crn 5634  cres 5635  cima 5636   Fn wfn 6491  cfv 6496  cmpo 7359  1st c1st 7919  2nd c2nd 7920
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922
This theorem is referenced by:  fmucnd  23644
  Copyright terms: Public domain W3C validator