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

Theorem imasaddflem 17458
Description: The image set operations are closed if the original operation is. (Contributed by Mario Carneiro, 23-Feb-2015.)
Hypotheses
Ref Expression
imasaddf.f (𝜑𝐹:𝑉onto𝐵)
imasaddf.e ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → (((𝐹𝑎) = (𝐹𝑝) ∧ (𝐹𝑏) = (𝐹𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞))))
imasaddflem.a (𝜑 = 𝑝𝑉 𝑞𝑉 {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
imasaddflem.c ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → (𝑝 · 𝑞) ∈ 𝑉)
Assertion
Ref Expression
imasaddflem (𝜑 :(𝐵 × 𝐵)⟶𝐵)
Distinct variable groups:   𝑞,𝑝,𝐵   𝑎,𝑏,𝑝,𝑞,𝑉   · ,𝑝,𝑞   𝐹,𝑎,𝑏,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞   ,𝑎,𝑏,𝑝,𝑞
Allowed substitution hints:   𝐵(𝑎,𝑏)   · (𝑎,𝑏)

Proof of Theorem imasaddflem
StepHypRef Expression
1 imasaddf.f . . 3 (𝜑𝐹:𝑉onto𝐵)
2 imasaddf.e . . 3 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → (((𝐹𝑎) = (𝐹𝑝) ∧ (𝐹𝑏) = (𝐹𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞))))
3 imasaddflem.a . . 3 (𝜑 = 𝑝𝑉 𝑞𝑉 {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
41, 2, 3imasaddfnlem 17456 . 2 (𝜑 Fn (𝐵 × 𝐵))
5 fof 6792 . . . . . . . . . 10 (𝐹:𝑉onto𝐵𝐹:𝑉𝐵)
61, 5syl 17 . . . . . . . . 9 (𝜑𝐹:𝑉𝐵)
7 ffvelcdm 7068 . . . . . . . . . . 11 ((𝐹:𝑉𝐵𝑝𝑉) → (𝐹𝑝) ∈ 𝐵)
8 ffvelcdm 7068 . . . . . . . . . . 11 ((𝐹:𝑉𝐵𝑞𝑉) → (𝐹𝑞) ∈ 𝐵)
97, 8anim12dan 619 . . . . . . . . . 10 ((𝐹:𝑉𝐵 ∧ (𝑝𝑉𝑞𝑉)) → ((𝐹𝑝) ∈ 𝐵 ∧ (𝐹𝑞) ∈ 𝐵))
10 opelxpi 5706 . . . . . . . . . 10 (((𝐹𝑝) ∈ 𝐵 ∧ (𝐹𝑞) ∈ 𝐵) → ⟨(𝐹𝑝), (𝐹𝑞)⟩ ∈ (𝐵 × 𝐵))
119, 10syl 17 . . . . . . . . 9 ((𝐹:𝑉𝐵 ∧ (𝑝𝑉𝑞𝑉)) → ⟨(𝐹𝑝), (𝐹𝑞)⟩ ∈ (𝐵 × 𝐵))
126, 11sylan 580 . . . . . . . 8 ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → ⟨(𝐹𝑝), (𝐹𝑞)⟩ ∈ (𝐵 × 𝐵))
13 imasaddflem.c . . . . . . . . 9 ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → (𝑝 · 𝑞) ∈ 𝑉)
14 ffvelcdm 7068 . . . . . . . . 9 ((𝐹:𝑉𝐵 ∧ (𝑝 · 𝑞) ∈ 𝑉) → (𝐹‘(𝑝 · 𝑞)) ∈ 𝐵)
156, 13, 14syl2an2r 683 . . . . . . . 8 ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → (𝐹‘(𝑝 · 𝑞)) ∈ 𝐵)
1612, 15opelxpd 5707 . . . . . . 7 ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → ⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩ ∈ ((𝐵 × 𝐵) × 𝐵))
1716snssd 4805 . . . . . 6 ((𝜑 ∧ (𝑝𝑉𝑞𝑉)) → {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} ⊆ ((𝐵 × 𝐵) × 𝐵))
1817anassrs 468 . . . . 5 (((𝜑𝑝𝑉) ∧ 𝑞𝑉) → {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} ⊆ ((𝐵 × 𝐵) × 𝐵))
1918iunssd 5046 . . . 4 ((𝜑𝑝𝑉) → 𝑞𝑉 {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} ⊆ ((𝐵 × 𝐵) × 𝐵))
2019iunssd 5046 . . 3 (𝜑 𝑝𝑉 𝑞𝑉 {⟨⟨(𝐹𝑝), (𝐹𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} ⊆ ((𝐵 × 𝐵) × 𝐵))
213, 20eqsstrd 4016 . 2 (𝜑 ⊆ ((𝐵 × 𝐵) × 𝐵))
22 dff2 7085 . 2 ( :(𝐵 × 𝐵)⟶𝐵 ↔ ( Fn (𝐵 × 𝐵) ∧ ⊆ ((𝐵 × 𝐵) × 𝐵)))
234, 21, 22sylanbrc 583 1 (𝜑 :(𝐵 × 𝐵)⟶𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wss 3944  {csn 4622  cop 4628   ciun 4990   × cxp 5667   Fn wfn 6527  wf 6528  ontowfo 6530  cfv 6532  (class class class)co 7393
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 2702  ax-sep 5292  ax-nul 5299  ax-pr 5420
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 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4523  df-sn 4623  df-pr 4625  df-op 4629  df-uni 4902  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-iota 6484  df-fun 6534  df-fn 6535  df-f 6536  df-fo 6538  df-fv 6540
This theorem is referenced by:  imasaddf  17461  imasmulf  17464  qusaddflem  17480
  Copyright terms: Public domain W3C validator