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

Theorem ofrfval 5720
Description: Value of a relation applied to two functions. (Contributed by Mario Carneiro, 28-Jul-2014.)
Hypotheses
Ref Expression
offval.1 (𝜑𝐹 Fn 𝐴)
offval.2 (𝜑𝐺 Fn 𝐵)
offval.3 (𝜑𝐴𝑉)
offval.4 (𝜑𝐵𝑊)
offval.5 (𝐴𝐵) = 𝑆
offval.6 ((𝜑𝑥𝐴) → (𝐹𝑥) = 𝐶)
offval.7 ((𝜑𝑥𝐵) → (𝐺𝑥) = 𝐷)
Assertion
Ref Expression
ofrfval (𝜑 → (𝐹𝑟 𝑅𝐺 ↔ ∀𝑥𝑆 𝐶𝑅𝐷))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝜑,𝑥   𝑥,𝑆   𝑥,𝑅
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem ofrfval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 offval.1 . . . 4 (𝜑𝐹 Fn 𝐴)
2 offval.3 . . . 4 (𝜑𝐴𝑉)
3 fnex 5383 . . . 4 ((𝐹 Fn 𝐴𝐴𝑉) → 𝐹 ∈ V)
41, 2, 3syl2anc 391 . . 3 (𝜑𝐹 ∈ V)
5 offval.2 . . . 4 (𝜑𝐺 Fn 𝐵)
6 offval.4 . . . 4 (𝜑𝐵𝑊)
7 fnex 5383 . . . 4 ((𝐺 Fn 𝐵𝐵𝑊) → 𝐺 ∈ V)
85, 6, 7syl2anc 391 . . 3 (𝜑𝐺 ∈ V)
9 dmeq 4535 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
10 dmeq 4535 . . . . . 6 (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
119, 10ineqan12d 3140 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
12 fveq1 5177 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
13 fveq1 5177 . . . . . 6 (𝑔 = 𝐺 → (𝑔𝑥) = (𝐺𝑥))
1412, 13breqan12d 3779 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓𝑥)𝑅(𝑔𝑥) ↔ (𝐹𝑥)𝑅(𝐺𝑥)))
1511, 14raleqbidv 2517 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → (∀𝑥 ∈ (dom 𝑓 ∩ dom 𝑔)(𝑓𝑥)𝑅(𝑔𝑥) ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹𝑥)𝑅(𝐺𝑥)))
16 df-ofr 5713 . . . 4 𝑟 𝑅 = {⟨𝑓, 𝑔⟩ ∣ ∀𝑥 ∈ (dom 𝑓 ∩ dom 𝑔)(𝑓𝑥)𝑅(𝑔𝑥)}
1715, 16brabga 4001 . . 3 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹𝑟 𝑅𝐺 ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹𝑥)𝑅(𝐺𝑥)))
184, 8, 17syl2anc 391 . 2 (𝜑 → (𝐹𝑟 𝑅𝐺 ↔ ∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹𝑥)𝑅(𝐺𝑥)))
19 fndm 4998 . . . . . 6 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
201, 19syl 14 . . . . 5 (𝜑 → dom 𝐹 = 𝐴)
21 fndm 4998 . . . . . 6 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
225, 21syl 14 . . . . 5 (𝜑 → dom 𝐺 = 𝐵)
2320, 22ineq12d 3139 . . . 4 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴𝐵))
24 offval.5 . . . 4 (𝐴𝐵) = 𝑆
2523, 24syl6eq 2088 . . 3 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
2625raleqdv 2511 . 2 (𝜑 → (∀𝑥 ∈ (dom 𝐹 ∩ dom 𝐺)(𝐹𝑥)𝑅(𝐺𝑥) ↔ ∀𝑥𝑆 (𝐹𝑥)𝑅(𝐺𝑥)))
27 inss1 3157 . . . . . . 7 (𝐴𝐵) ⊆ 𝐴
2824, 27eqsstr3i 2976 . . . . . 6 𝑆𝐴
2928sseli 2941 . . . . 5 (𝑥𝑆𝑥𝐴)
30 offval.6 . . . . 5 ((𝜑𝑥𝐴) → (𝐹𝑥) = 𝐶)
3129, 30sylan2 270 . . . 4 ((𝜑𝑥𝑆) → (𝐹𝑥) = 𝐶)
32 inss2 3158 . . . . . . 7 (𝐴𝐵) ⊆ 𝐵
3324, 32eqsstr3i 2976 . . . . . 6 𝑆𝐵
3433sseli 2941 . . . . 5 (𝑥𝑆𝑥𝐵)
35 offval.7 . . . . 5 ((𝜑𝑥𝐵) → (𝐺𝑥) = 𝐷)
3634, 35sylan2 270 . . . 4 ((𝜑𝑥𝑆) → (𝐺𝑥) = 𝐷)
3731, 36breq12d 3777 . . 3 ((𝜑𝑥𝑆) → ((𝐹𝑥)𝑅(𝐺𝑥) ↔ 𝐶𝑅𝐷))
3837ralbidva 2322 . 2 (𝜑 → (∀𝑥𝑆 (𝐹𝑥)𝑅(𝐺𝑥) ↔ ∀𝑥𝑆 𝐶𝑅𝐷))
3918, 26, 383bitrd 203 1 (𝜑 → (𝐹𝑟 𝑅𝐺 ↔ ∀𝑥𝑆 𝐶𝑅𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wb 98   = wceq 1243  wcel 1393  wral 2306  Vcvv 2557  cin 2916   class class class wbr 3764  dom cdm 4345   Fn wfn 4897  cfv 4902  𝑟 cofr 5711
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ofr 5713
This theorem is referenced by:  ofrval  5722  ofrfval2  5727  caofref  5732  caofrss  5735  caoftrn  5736
  Copyright terms: Public domain W3C validator