ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  off GIF version

Theorem off 5882
Description: The function operation produces a function. (Contributed by Mario Carneiro, 20-Jul-2014.)
Hypotheses
Ref Expression
off.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈)
off.2 (𝜑𝐹:𝐴𝑆)
off.3 (𝜑𝐺:𝐵𝑇)
off.4 (𝜑𝐴𝑉)
off.5 (𝜑𝐵𝑊)
off.6 (𝐴𝐵) = 𝐶
Assertion
Ref Expression
off (𝜑 → (𝐹𝑓 𝑅𝐺):𝐶𝑈)
Distinct variable groups:   𝑦,𝐺   𝑥,𝑦,𝜑   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝑥,𝐹,𝑦   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐺(𝑥)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem off
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 off.2 . . . . 5 (𝜑𝐹:𝐴𝑆)
2 off.6 . . . . . . 7 (𝐴𝐵) = 𝐶
3 inss1 3221 . . . . . . 7 (𝐴𝐵) ⊆ 𝐴
42, 3eqsstr3i 3058 . . . . . 6 𝐶𝐴
54sseli 3022 . . . . 5 (𝑧𝐶𝑧𝐴)
6 ffvelrn 5446 . . . . 5 ((𝐹:𝐴𝑆𝑧𝐴) → (𝐹𝑧) ∈ 𝑆)
71, 5, 6syl2an 284 . . . 4 ((𝜑𝑧𝐶) → (𝐹𝑧) ∈ 𝑆)
8 off.3 . . . . 5 (𝜑𝐺:𝐵𝑇)
9 inss2 3222 . . . . . . 7 (𝐴𝐵) ⊆ 𝐵
102, 9eqsstr3i 3058 . . . . . 6 𝐶𝐵
1110sseli 3022 . . . . 5 (𝑧𝐶𝑧𝐵)
12 ffvelrn 5446 . . . . 5 ((𝐺:𝐵𝑇𝑧𝐵) → (𝐺𝑧) ∈ 𝑇)
138, 11, 12syl2an 284 . . . 4 ((𝜑𝑧𝐶) → (𝐺𝑧) ∈ 𝑇)
14 off.1 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈)
1514ralrimivva 2456 . . . . 5 (𝜑 → ∀𝑥𝑆𝑦𝑇 (𝑥𝑅𝑦) ∈ 𝑈)
1615adantr 271 . . . 4 ((𝜑𝑧𝐶) → ∀𝑥𝑆𝑦𝑇 (𝑥𝑅𝑦) ∈ 𝑈)
17 oveq1 5673 . . . . . 6 (𝑥 = (𝐹𝑧) → (𝑥𝑅𝑦) = ((𝐹𝑧)𝑅𝑦))
1817eleq1d 2157 . . . . 5 (𝑥 = (𝐹𝑧) → ((𝑥𝑅𝑦) ∈ 𝑈 ↔ ((𝐹𝑧)𝑅𝑦) ∈ 𝑈))
19 oveq2 5674 . . . . . 6 (𝑦 = (𝐺𝑧) → ((𝐹𝑧)𝑅𝑦) = ((𝐹𝑧)𝑅(𝐺𝑧)))
2019eleq1d 2157 . . . . 5 (𝑦 = (𝐺𝑧) → (((𝐹𝑧)𝑅𝑦) ∈ 𝑈 ↔ ((𝐹𝑧)𝑅(𝐺𝑧)) ∈ 𝑈))
2118, 20rspc2va 2736 . . . 4 ((((𝐹𝑧) ∈ 𝑆 ∧ (𝐺𝑧) ∈ 𝑇) ∧ ∀𝑥𝑆𝑦𝑇 (𝑥𝑅𝑦) ∈ 𝑈) → ((𝐹𝑧)𝑅(𝐺𝑧)) ∈ 𝑈)
227, 13, 16, 21syl21anc 1174 . . 3 ((𝜑𝑧𝐶) → ((𝐹𝑧)𝑅(𝐺𝑧)) ∈ 𝑈)
23 eqid 2089 . . 3 (𝑧𝐶 ↦ ((𝐹𝑧)𝑅(𝐺𝑧))) = (𝑧𝐶 ↦ ((𝐹𝑧)𝑅(𝐺𝑧)))
2422, 23fmptd 5466 . 2 (𝜑 → (𝑧𝐶 ↦ ((𝐹𝑧)𝑅(𝐺𝑧))):𝐶𝑈)
25 ffn 5174 . . . . 5 (𝐹:𝐴𝑆𝐹 Fn 𝐴)
261, 25syl 14 . . . 4 (𝜑𝐹 Fn 𝐴)
27 ffn 5174 . . . . 5 (𝐺:𝐵𝑇𝐺 Fn 𝐵)
288, 27syl 14 . . . 4 (𝜑𝐺 Fn 𝐵)
29 off.4 . . . 4 (𝜑𝐴𝑉)
30 off.5 . . . 4 (𝜑𝐵𝑊)
31 eqidd 2090 . . . 4 ((𝜑𝑧𝐴) → (𝐹𝑧) = (𝐹𝑧))
32 eqidd 2090 . . . 4 ((𝜑𝑧𝐵) → (𝐺𝑧) = (𝐺𝑧))
3326, 28, 29, 30, 2, 31, 32offval 5877 . . 3 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑧𝐶 ↦ ((𝐹𝑧)𝑅(𝐺𝑧))))
3433feq1d 5162 . 2 (𝜑 → ((𝐹𝑓 𝑅𝐺):𝐶𝑈 ↔ (𝑧𝐶 ↦ ((𝐹𝑧)𝑅(𝐺𝑧))):𝐶𝑈))
3524, 34mpbird 166 1 (𝜑 → (𝐹𝑓 𝑅𝐺):𝐶𝑈)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1290  wcel 1439  wral 2360  cin 2999  cmpt 3905   Fn wfn 5023  wf 5024  cfv 5028  (class class class)co 5666  𝑓 cof 5868
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-pow 4015  ax-pr 4045  ax-setind 4366
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-id 4129  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-rn 4463  df-res 4464  df-ima 4465  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-of 5870
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator