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

Theorem foeqcnvco 7247
Description: Condition for function equality in terms of vanishing of the composition with the converse. EDITORIAL: Is there a relation-algebraic proof of this? (Contributed by Stefan O'Rear, 12-Feb-2015.)
Assertion
Ref Expression
foeqcnvco ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐵)))

Proof of Theorem foeqcnvco
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fococnv2 6811 . . . 4 (𝐹:𝐴onto𝐵 → (𝐹𝐹) = ( I ↾ 𝐵))
2 cnveq 5830 . . . . . 6 (𝐹 = 𝐺𝐹 = 𝐺)
32coeq2d 5819 . . . . 5 (𝐹 = 𝐺 → (𝐹𝐹) = (𝐹𝐺))
43eqeq1d 2735 . . . 4 (𝐹 = 𝐺 → ((𝐹𝐹) = ( I ↾ 𝐵) ↔ (𝐹𝐺) = ( I ↾ 𝐵)))
51, 4syl5ibcom 244 . . 3 (𝐹:𝐴onto𝐵 → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐵)))
65adantr 482 . 2 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 → (𝐹𝐺) = ( I ↾ 𝐵)))
7 fofn 6759 . . . . 5 (𝐹:𝐴onto𝐵𝐹 Fn 𝐴)
87ad2antrr 725 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐹 Fn 𝐴)
9 fofn 6759 . . . . 5 (𝐺:𝐴onto𝐵𝐺 Fn 𝐴)
109ad2antlr 726 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐺 Fn 𝐴)
119adantl 483 . . . . . . . . . . . 12 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐺 Fn 𝐴)
12 fnopfv 7027 . . . . . . . . . . . 12 ((𝐺 Fn 𝐴𝑥𝐴) → ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1311, 12sylan 581 . . . . . . . . . . 11 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
14 fvex 6856 . . . . . . . . . . . . 13 (𝐺𝑥) ∈ V
15 vex 3448 . . . . . . . . . . . . 13 𝑥 ∈ V
1614, 15brcnv 5839 . . . . . . . . . . . 12 ((𝐺𝑥)𝐺𝑥𝑥𝐺(𝐺𝑥))
17 df-br 5107 . . . . . . . . . . . 12 (𝑥𝐺(𝐺𝑥) ↔ ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1816, 17bitri 275 . . . . . . . . . . 11 ((𝐺𝑥)𝐺𝑥 ↔ ⟨𝑥, (𝐺𝑥)⟩ ∈ 𝐺)
1913, 18sylibr 233 . . . . . . . . . 10 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥)𝐺𝑥)
207adantr 482 . . . . . . . . . . . 12 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐹 Fn 𝐴)
21 fnopfv 7027 . . . . . . . . . . . 12 ((𝐹 Fn 𝐴𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
2220, 21sylan 581 . . . . . . . . . . 11 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
23 df-br 5107 . . . . . . . . . . 11 (𝑥𝐹(𝐹𝑥) ↔ ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝐹)
2422, 23sylibr 233 . . . . . . . . . 10 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → 𝑥𝐹(𝐹𝑥))
25 breq2 5110 . . . . . . . . . . . 12 (𝑦 = 𝑥 → ((𝐺𝑥)𝐺𝑦 ↔ (𝐺𝑥)𝐺𝑥))
26 breq1 5109 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑦𝐹(𝐹𝑥) ↔ 𝑥𝐹(𝐹𝑥)))
2725, 26anbi12d 632 . . . . . . . . . . 11 (𝑦 = 𝑥 → (((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)) ↔ ((𝐺𝑥)𝐺𝑥𝑥𝐹(𝐹𝑥))))
2815, 27spcev 3564 . . . . . . . . . 10 (((𝐺𝑥)𝐺𝑥𝑥𝐹(𝐹𝑥)) → ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
2919, 24, 28syl2anc 585 . . . . . . . . 9 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
30 fvex 6856 . . . . . . . . . 10 (𝐹𝑥) ∈ V
3114, 30brco 5827 . . . . . . . . 9 ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ ∃𝑦((𝐺𝑥)𝐺𝑦𝑦𝐹(𝐹𝑥)))
3229, 31sylibr 233 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥)(𝐹𝐺)(𝐹𝑥))
3332adantlr 714 . . . . . . 7 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥)(𝐹𝐺)(𝐹𝑥))
34 breq 5108 . . . . . . . 8 ((𝐹𝐺) = ( I ↾ 𝐵) → ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥)))
3534ad2antlr 726 . . . . . . 7 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → ((𝐺𝑥)(𝐹𝐺)(𝐹𝑥) ↔ (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥)))
3633, 35mpbid 231 . . . . . 6 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥))
37 fof 6757 . . . . . . . . . 10 (𝐺:𝐴onto𝐵𝐺:𝐴𝐵)
3837adantl 483 . . . . . . . . 9 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐺:𝐴𝐵)
3938ffvelcdmda 7036 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐺𝑥) ∈ 𝐵)
40 fof 6757 . . . . . . . . . 10 (𝐹:𝐴onto𝐵𝐹:𝐴𝐵)
4140adantr 482 . . . . . . . . 9 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → 𝐹:𝐴𝐵)
4241ffvelcdmda 7036 . . . . . . . 8 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝐵)
43 resieq 5949 . . . . . . . 8 (((𝐺𝑥) ∈ 𝐵 ∧ (𝐹𝑥) ∈ 𝐵) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4439, 42, 43syl2anc 585 . . . . . . 7 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ 𝑥𝐴) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4544adantlr 714 . . . . . 6 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → ((𝐺𝑥)( I ↾ 𝐵)(𝐹𝑥) ↔ (𝐺𝑥) = (𝐹𝑥)))
4636, 45mpbid 231 . . . . 5 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐺𝑥) = (𝐹𝑥))
4746eqcomd 2739 . . . 4 ((((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) ∧ 𝑥𝐴) → (𝐹𝑥) = (𝐺𝑥))
488, 10, 47eqfnfvd 6986 . . 3 (((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) ∧ (𝐹𝐺) = ( I ↾ 𝐵)) → 𝐹 = 𝐺)
4948ex 414 . 2 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → ((𝐹𝐺) = ( I ↾ 𝐵) → 𝐹 = 𝐺))
506, 49impbid 211 1 ((𝐹:𝐴onto𝐵𝐺:𝐴onto𝐵) → (𝐹 = 𝐺 ↔ (𝐹𝐺) = ( I ↾ 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397   = wceq 1542  wex 1782  wcel 2107  cop 4593   class class class wbr 5106   I cid 5531  ccnv 5633  cres 5636  ccom 5638   Fn wfn 6492  wf 6493  ontowfo 6495  cfv 6497
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pr 5385
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-sbc 3741  df-csb 3857  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-fo 6503  df-fv 6505
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator