Theorem inl11 7066

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 7048	. . . 4 |- inl = ( x e. _V |-> <. (/) , x >. )
2		opeq2 3781	. . . 4 |- ( x = A -> <. (/) , x >. = <. (/) , A >. )
3		elex 2750	. . . . 5 |- ( A e. V -> A e. _V )
4	3	adantr 276	. . . 4 |- ( ( A e. V /\ B e. W ) -> A e. _V )
5		0ex 4132	. . . . 5 |- (/) e. _V
6		simpl 109	. . . . 5 |- ( ( A e. V /\ B e. W ) -> A e. V )
7		opexg 4230	. . . . 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 5611	. . 3 |- ( ( A e. V /\ B e. W ) -> (inl ` A ) = <. (/) , A >. )
10		opeq2 3781	. . . 4 |- ( x = B -> <. (/) , x >. = <. (/) , B >. )
11		elex 2750	. . . . 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 4230	. . . . 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 5611	. . 3 |- ( ( A e. V /\ B e. W ) -> (inl ` B ) = <. (/) , B >. )
17	9, 16	eqeq12d 2192	. 2 |- ( ( A e. V /\ B e. W ) -> ( (inl ` A ) = (inl ` B ) <-> <. (/) , A >. = <. (/) , B >. ) )
18		opthg 4240	. . . . 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 2177	. . . . 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 1353   e. wcel 2148   _Vcvv 2739   (/)c0 3424   <.cop 3597   ` cfv 5218  inlcinl 7046

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-inl 7048

This theorem is referenced by:  omp1eomlem  7095  difinfsnlem  7100