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

Theorem ofrval 6313
Description: Exhibit a function relation at a point. (Contributed by Mario Carneiro, 28-Jul-2014.)
Hypotheses
Ref Expression
offval.1 (𝜑 → 𝐹 Fn 𝐴)
offval.2 (𝜑 → 𝐺 Fn 𝐵)
offval.3 (𝜑 → 𝐴 ∈ 𝑉)
offval.4 (𝜑 → 𝐵 ∈ 𝑊)
offval.5 (𝐴 ∩ 𝐵) = 𝑆
ofrval.6 ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
ofrval.7 ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)
Assertion
Ref Expression
ofrval ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷)

Proof of Theorem ofrval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 offval.1 . . . . . 6 (𝜑 → 𝐹 Fn 𝐴)
2 offval.2 . . . . . 6 (𝜑 → 𝐺 Fn 𝐵)
3 offval.3 . . . . . 6 (𝜑 → 𝐴 ∈ 𝑉)
4 offval.4 . . . . . 6 (𝜑 → 𝐵 ∈ 𝑊)
5 offval.5 . . . . . 6 (𝐴 ∩ 𝐵) = 𝑆
6 eqidd 2239 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥))
7 eqidd 2239 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥))
81, 2, 3, 4, 5, 6, 7ofrfval 6311 . . . . 5 (𝜑 → (𝐹 ∘𝑟 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)))
98biimpa 296 . . . 4 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥))
10 fveq2 5695 . . . . . 6 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
11 fveq2 5695 . . . . . 6 (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
1210, 11breq12d 4143 . . . . 5 (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
1312rspccv 2926 . . . 4 (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
149, 13syl 14 . . 3 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
15143impia 1231 . 2 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋)𝑅(𝐺‘𝑋))
16 simp1 1028 . . 3 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝜑)
17 inss1 3451 . . . . 5 (𝐴 ∩ 𝐵) ⊆ 𝐴
185, 17eqsstrri 3281 . . . 4 𝑆 ⊆ 𝐴
19 simp3 1030 . . . 4 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆)
2018, 19sselid 3246 . . 3 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐴)
21 ofrval.6 . . 3 ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
2216, 20, 21syl2anc 415 . 2 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶)
23 inss2 3452 . . . . 5 (𝐴 ∩ 𝐵) ⊆ 𝐵
245, 23eqsstrri 3281 . . . 4 𝑆 ⊆ 𝐵
2524, 19sselid 3246 . . 3 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵)
26 ofrval.7 . . 3 ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)
2716, 25, 26syl2anc 415 . 2 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷)
2815, 22, 273brtr3d 4161 1 ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ∩ cin 3219   class class class wbr 4130   Fn wfn 5372  ‘cfv 5377   ∘𝑟 cofr 6301
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ofr 6303
This theorem is used by:  psrbaglesuppg  15141  psrbaglefifi  15147
  Copyright terms: Public domain W3C validator