foeqcnvco - Intuitionistic Logic Explorer

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

Theorem foeqcnvco 5699

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.

Step	Hyp	Ref	Expression
1		fococnv2 5401	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐹 ∘ ^◡𝐹) = ( I ↾ 𝐵))
2		cnveq 4721	. . . . . 6 ⊢ (𝐹 = 𝐺 → ^◡𝐹 = ^◡𝐺)
3	2	coeq2d 4709	. . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹 ∘ ^◡𝐹) = (𝐹 ∘ ^◡𝐺))
4	3	eqeq1d 2149	. . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹 ∘ ^◡𝐹) = ( I ↾ 𝐵) ↔ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)))
5	1, 4	syl5ibcom 154	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐹 = 𝐺 → (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)))
6	5	adantr 274	. 2 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → (𝐹 = 𝐺 → (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)))
7		fofn 5355	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴)
8	7	ad2antrr 480	. . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) → 𝐹 Fn 𝐴)
9		fofn 5355	. . . . 5 ⊢ (𝐺:𝐴–onto→𝐵 → 𝐺 Fn 𝐴)
10	9	ad2antlr 481	. . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) → 𝐺 Fn 𝐴)
11	9	adantl 275	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → 𝐺 Fn 𝐴)
12		fnopfv 5558	. . . . . . . . . . . 12 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ⟨𝑥, (𝐺‘𝑥)⟩ ∈ 𝐺)
13	11, 12	sylan 281	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ⟨𝑥, (𝐺‘𝑥)⟩ ∈ 𝐺)
14	9	anim1i 338	. . . . . . . . . . . . 13 ⊢ ((𝐺:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴))
15	14	adantll 468	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴))
16		funfvex 5446	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐺 ∧ 𝑥 ∈ dom 𝐺) → (𝐺‘𝑥) ∈ V)
17	16	funfni 5231	. . . . . . . . . . . . . 14 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ V)
18		vex 2692	. . . . . . . . . . . . . 14 ⊢ 𝑥 ∈ V
19		brcnvg 4728	. . . . . . . . . . . . . 14 ⊢ (((𝐺‘𝑥) ∈ V ∧ 𝑥 ∈ V) → ((𝐺‘𝑥)^◡𝐺𝑥 ↔ 𝑥𝐺(𝐺‘𝑥)))
20	17, 18, 19	sylancl 410	. . . . . . . . . . . . 13 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)^◡𝐺𝑥 ↔ 𝑥𝐺(𝐺‘𝑥)))
21		df-br 3938	. . . . . . . . . . . . 13 ⊢ (𝑥𝐺(𝐺‘𝑥) ↔ ⟨𝑥, (𝐺‘𝑥)⟩ ∈ 𝐺)
22	20, 21	syl6bb 195	. . . . . . . . . . . 12 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)^◡𝐺𝑥 ↔ ⟨𝑥, (𝐺‘𝑥)⟩ ∈ 𝐺))
23	15, 22	syl 14	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)^◡𝐺𝑥 ↔ ⟨𝑥, (𝐺‘𝑥)⟩ ∈ 𝐺))
24	13, 23	mpbird 166	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥)^◡𝐺𝑥)
25	7	adantr 274	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → 𝐹 Fn 𝐴)
26		fnopfv 5558	. . . . . . . . . . . 12 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
27	25, 26	sylan 281	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
28		df-br 3938	. . . . . . . . . . 11 ⊢ (𝑥𝐹(𝐹‘𝑥) ↔ ⟨𝑥, (𝐹‘𝑥)⟩ ∈ 𝐹)
29	27, 28	sylibr 133	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑥𝐹(𝐹‘𝑥))
30		breq2 3941	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → ((𝐺‘𝑥)^◡𝐺𝑦 ↔ (𝐺‘𝑥)^◡𝐺𝑥))
31		breq1 3940	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝑦𝐹(𝐹‘𝑥) ↔ 𝑥𝐹(𝐹‘𝑥)))
32	30, 31	anbi12d 465	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (((𝐺‘𝑥)^◡𝐺𝑦 ∧ 𝑦𝐹(𝐹‘𝑥)) ↔ ((𝐺‘𝑥)^◡𝐺𝑥 ∧ 𝑥𝐹(𝐹‘𝑥))))
33	18, 32	spcev 2784	. . . . . . . . . 10 ⊢ (((𝐺‘𝑥)^◡𝐺𝑥 ∧ 𝑥𝐹(𝐹‘𝑥)) → ∃𝑦((𝐺‘𝑥)^◡𝐺𝑦 ∧ 𝑦𝐹(𝐹‘𝑥)))
34	24, 29, 33	syl2anc 409	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ∃𝑦((𝐺‘𝑥)^◡𝐺𝑦 ∧ 𝑦𝐹(𝐹‘𝑥)))
35	15, 17	syl 14	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ V)
36	7	anim1i 338	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴))
37	36	adantlr 469	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴))
38		funfvex 5446	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V)
39	38	funfni 5231	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ V)
40	37, 39	syl 14	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ V)
41		brcog 4714	. . . . . . . . . 10 ⊢ (((𝐺‘𝑥) ∈ V ∧ (𝐹‘𝑥) ∈ V) → ((𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥) ↔ ∃𝑦((𝐺‘𝑥)^◡𝐺𝑦 ∧ 𝑦𝐹(𝐹‘𝑥))))
42	35, 40, 41	syl2anc 409	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥) ↔ ∃𝑦((𝐺‘𝑥)^◡𝐺𝑦 ∧ 𝑦𝐹(𝐹‘𝑥))))
43	34, 42	mpbird 166	. . . . . . . 8 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥))
44	43	adantlr 469	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥))
45		breq 3939	. . . . . . . 8 ⊢ ((𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵) → ((𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥) ↔ (𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥)))
46	45	ad2antlr 481	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)(𝐹 ∘ ^◡𝐺)(𝐹‘𝑥) ↔ (𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥)))
47	44, 46	mpbid 146	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥))
48		fof 5353	. . . . . . . . . 10 ⊢ (𝐺:𝐴–onto→𝐵 → 𝐺:𝐴⟶𝐵)
49	48	adantl 275	. . . . . . . . 9 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → 𝐺:𝐴⟶𝐵)
50	49	ffvelrnda 5563	. . . . . . . 8 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) ∈ 𝐵)
51		fof 5353	. . . . . . . . . 10 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
52	51	adantr 274	. . . . . . . . 9 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → 𝐹:𝐴⟶𝐵)
53	52	ffvelrnda 5563	. . . . . . . 8 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
54		resieq 4837	. . . . . . . 8 ⊢ (((𝐺‘𝑥) ∈ 𝐵 ∧ (𝐹‘𝑥) ∈ 𝐵) → ((𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥) ↔ (𝐺‘𝑥) = (𝐹‘𝑥)))
55	50, 53, 54	syl2anc 409	. . . . . . 7 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥) ↔ (𝐺‘𝑥) = (𝐹‘𝑥)))
56	55	adantlr 469	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥)( I ↾ 𝐵)(𝐹‘𝑥) ↔ (𝐺‘𝑥) = (𝐹‘𝑥)))
57	47, 56	mpbid 146	. . . . 5 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝐹‘𝑥))
58	57	eqcomd 2146	. . . 4 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐺‘𝑥))
59	8, 10, 58	eqfnfvd 5529	. . 3 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) ∧ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)) → 𝐹 = 𝐺)
60	59	ex 114	. 2 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → ((𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵) → 𝐹 = 𝐺))
61	6, 60	impbid 128	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐴–onto→𝐵) → (𝐹 = 𝐺 ↔ (𝐹 ∘ ^◡𝐺) = ( I ↾ 𝐵)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1332 ∃wex 1469 ∈ wcel 1481 Vcvv 2689 ⟨cop 3535 class class class wbr 3937 I cid 4218 ^◡ccnv 4546 ↾ cres 4549 ∘ ccom 4551 Fn wfn 5126 ⟶wf 5127 –onto→wfo 5129 ‘cfv 5131

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139

This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-sbc 2914 df-csb 3008 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-mpt 3999 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-fo 5137 df-fv 5139

This theorem is referenced by: (None)

W3C validator