Theorem inl11 7356

Description: Left injection is one-to-one. (Contributed by Jim Kingdon, 12-Jul-2023.)

Assertion

Ref	Expression
inl11	|- ( ( A e. V /\ B e. W ) -> ( (inl ` A ) = (inl ` B ) <-> A = B ) )

Proof of Theorem inl11

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-inl 7338	. . . 4 |- inl = ( x e. _V |-> <. (/) , x >. )
2		opeq2 3884	. . . 4 |- ( x = A -> <. (/) , x >. = <. (/) , A >. )
3		elex 2825	. . . . 5 |- ( A e. V -> A e. _V )
4	3	adantr 276	. . . 4 |- ( ( A e. V /\ B e. W ) -> A e. _V )
5		0ex 4237	. . . . 5 |- (/) e. _V
6		simpl 109	. . . . 5 |- ( ( A e. V /\ B e. W ) -> A e. V )
7		opexg 4344	. . . . 5 |- ( ( (/) e. _V /\ A e. V ) -> <. (/) , A >. e. _V )
8	5, 6, 7	sylancr 414	. . . 4 |- ( ( A e. V /\ B e. W ) -> <. (/) , A >. e. _V )
9	1, 2, 4, 8	fvmptd3 5771	. . 3 |- ( ( A e. V /\ B e. W ) -> (inl ` A ) = <. (/) , A >. )
10		opeq2 3884	. . . 4 |- ( x = B -> <. (/) , x >. = <. (/) , B >. )
11		elex 2825	. . . . 5 |- ( B e. W -> B e. _V )
12	11	adantl 277	. . . 4 |- ( ( A e. V /\ B e. W ) -> B e. _V )
13	5	a1i 9	. . . . 5 |- ( ( A e. V /\ B e. W ) -> (/) e. _V )
14		opexg 4344	. . . . 5 |- ( ( (/) e. _V /\ B e. W ) -> <. (/) , B >. e. _V )
15	13, 14	sylancom 420	. . . 4 |- ( ( A e. V /\ B e. W ) -> <. (/) , B >. e. _V )
16	1, 10, 12, 15	fvmptd3 5771	. . 3 |- ( ( A e. V /\ B e. W ) -> (inl ` B ) = <. (/) , B >. )
17	9, 16	eqeq12d 2247	. 2 |- ( ( A e. V /\ B e. W ) -> ( (inl ` A ) = (inl ` B ) <-> <. (/) , A >. = <. (/) , B >. ) )
18		opthg 4354	. . . . 5 |- ( ( (/) e. _V /\ A e. V ) -> ( <. (/) , A >. = <. (/) , B >. <-> ( (/) = (/) /\ A = B ) ) )
19	5, 18	mpan 424	. . . 4 |- ( A e. V -> ( <. (/) , A >. = <. (/) , B >. <-> ( (/) = (/) /\ A = B ) ) )
20		eqid 2232	. . . . 5 |- (/) = (/)
21	20	biantrur 303	. . . 4 |- ( A = B <-> ( (/) = (/) /\ A = B ) )
22	19, 21	bitr4di 198	. . 3 |- ( A e. V -> ( <. (/) , A >. = <. (/) , B >. <-> A = B ) )
23	22	adantr 276	. 2 |- ( ( A e. V /\ B e. W ) -> ( <. (/) , A >. = <. (/) , B >. <-> A = B ) )
24	17, 23	bitrd 188	1 |- ( ( A e. V /\ B e. W ) -> ( (inl ` A ) = (inl ` B ) <-> A = B ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2203   _Vcvv 2813   (/)c0 3508   <.cop 3692   ` cfv 5352  inlcinl 7336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-inl 7338

This theorem is referenced by:  omp1eomlem  7385  difinfsnlem  7390