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

Theorem fmucndlem 22895
 Description: Lemma for fmucnd 22896. (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 5545 . . 3 ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴))
2 simpr 488 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → 𝐴𝑋)
3 resmpo 7256 . . . . 5 ((𝐴𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
42, 3sylancom 591 . . . 4 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
54rneqd 5785 . . 3 ((𝐹 Fn 𝑋𝐴𝑋) → ran ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↾ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
61, 5syl5eq 2869 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩))
7 vex 3472 . . . . . . . . . . . . 13 𝑥 ∈ V
8 vex 3472 . . . . . . . . . . . . 13 𝑦 ∈ V
97, 8op1std 7685 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (1st𝑝) = 𝑥)
109fveq2d 6656 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(1st𝑝)) = (𝐹𝑥))
117, 8op2ndd 7686 . . . . . . . . . . . 12 (𝑝 = ⟨𝑥, 𝑦⟩ → (2nd𝑝) = 𝑦)
1211fveq2d 6656 . . . . . . . . . . 11 (𝑝 = ⟨𝑥, 𝑦⟩ → (𝐹‘(2nd𝑝)) = (𝐹𝑦))
1310, 12opeq12d 4786 . . . . . . . . . 10 (𝑝 = ⟨𝑥, 𝑦⟩ → ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1413mpompt 7250 . . . . . . . . 9 (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
1514eqcomi 2831 . . . . . . . 8 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
1615rneqi 5784 . . . . . . 7 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ran (𝑝 ∈ (𝐴 × 𝐴) ↦ ⟨(𝐹‘(1st𝑝)), (𝐹‘(2nd𝑝))⟩)
17 fvexd 6667 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(1st𝑝)) ∈ V)
18 fvexd 6667 . . . . . . 7 ((⊤ ∧ 𝑝 ∈ (𝐴 × 𝐴)) → (𝐹‘(2nd𝑝)) ∈ V)
1916, 17, 18fliftrel 7045 . . . . . 6 (⊤ → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V))
2019mptru 1545 . . . . 5 ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ⊆ (V × V)
2120sseli 3938 . . . 4 (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) → 𝑝 ∈ (V × V))
2221adantl 485 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)) → 𝑝 ∈ (V × V))
23 xpss 5548 . . . . 5 ((𝐹𝐴) × (𝐹𝐴)) ⊆ (V × V)
2423sseli 3938 . . . 4 (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) → 𝑝 ∈ (V × V))
2524adantl 485 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))) → 𝑝 ∈ (V × V))
26 fvelimab 6719 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((1st𝑝) ∈ (𝐹𝐴) ↔ ∃𝑥𝐴 (𝐹𝑥) = (1st𝑝)))
27 fvelimab 6719 . . . . . . . 8 ((𝐹 Fn 𝑋𝐴𝑋) → ((2nd𝑝) ∈ (𝐹𝐴) ↔ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
2826, 27anbi12d 633 . . . . . . 7 ((𝐹 Fn 𝑋𝐴𝑋) → (((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝))))
29 eqid 2822 . . . . . . . . 9 (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)
30 opex 5333 . . . . . . . . 9 ⟨(𝐹𝑥), (𝐹𝑦)⟩ ∈ V
3129, 30elrnmpo 7271 . . . . . . . 8 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩)
32 eqcom 2829 . . . . . . . . . 10 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩)
33 fvex 6665 . . . . . . . . . . 11 (1st𝑝) ∈ V
34 fvex 6665 . . . . . . . . . . 11 (2nd𝑝) ∈ V
3533, 34opth2 5349 . . . . . . . . . 10 (⟨(𝐹𝑥), (𝐹𝑦)⟩ = ⟨(1st𝑝), (2nd𝑝)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
3632, 35bitri 278 . . . . . . . . 9 (⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
37362rexbii 3236 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ⟨(1st𝑝), (2nd𝑝)⟩ = ⟨(𝐹𝑥), (𝐹𝑦)⟩ ↔ ∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)))
38 reeanv 3348 . . . . . . . 8 (∃𝑥𝐴𝑦𝐴 ((𝐹𝑥) = (1st𝑝) ∧ (𝐹𝑦) = (2nd𝑝)) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
3931, 37, 383bitri 300 . . . . . . 7 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ (∃𝑥𝐴 (𝐹𝑥) = (1st𝑝) ∧ ∃𝑦𝐴 (𝐹𝑦) = (2nd𝑝)))
4028, 39syl6rbbr 293 . . . . . 6 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴))))
41 opelxp 5568 . . . . . 6 (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ((1st𝑝) ∈ (𝐹𝐴) ∧ (2nd𝑝) ∈ (𝐹𝐴)))
4240, 41syl6bbr 292 . . . . 5 ((𝐹 Fn 𝑋𝐴𝑋) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4342adantr 484 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
44 1st2nd2 7714 . . . . . 6 (𝑝 ∈ (V × V) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4544adantl 485 . . . . 5 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → 𝑝 = ⟨(1st𝑝), (2nd𝑝)⟩)
4645eleq1d 2898 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩)))
4745eleq1d 2898 . . . 4 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴)) ↔ ⟨(1st𝑝), (2nd𝑝)⟩ ∈ ((𝐹𝐴) × (𝐹𝐴))))
4843, 46, 473bitr4d 314 . . 3 (((𝐹 Fn 𝑋𝐴𝑋) ∧ 𝑝 ∈ (V × V)) → (𝑝 ∈ ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) ↔ 𝑝 ∈ ((𝐹𝐴) × (𝐹𝐴))))
4922, 25, 48eqrdav 2821 . 2 ((𝐹 Fn 𝑋𝐴𝑋) → ran (𝑥𝐴, 𝑦𝐴 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) = ((𝐹𝐴) × (𝐹𝐴)))
506, 49eqtrd 2857 1 ((𝐹 Fn 𝑋𝐴𝑋) → ((𝑥𝑋, 𝑦𝑋 ↦ ⟨(𝐹𝑥), (𝐹𝑦)⟩) “ (𝐴 × 𝐴)) = ((𝐹𝐴) × (𝐹𝐴)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538  ⊤wtru 1539   ∈ wcel 2114  ∃wrex 3131  Vcvv 3469   ⊆ wss 3908  ⟨cop 4545   ↦ cmpt 5122   × cxp 5530  ran crn 5533   ↾ cres 5534   “ cima 5535   Fn wfn 6329  ‘cfv 6334   ∈ cmpo 7142  1st c1st 7673  2nd c2nd 7674 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 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446 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 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-fv 6342  df-oprab 7144  df-mpo 7145  df-1st 7675  df-2nd 7676 This theorem is referenced by:  fmucnd  22896
 Copyright terms: Public domain W3C validator