Theorem reiota2 5110

Description: A condition that allows us to represent "the unique element in A such that ph " with a class expression B. Compare reuuni2 3811.

Hypothesis

Ref	Expression
reiota2.1	|- (x = B -> (ph <-> ps))

Assertion

Ref	Expression
reiota2	|- ((B e. A /\ E!x e. A ph) -> (ps <-> (iotax(x e. A /\ ph)) = B))

Distinct variable groups:   x,A   x,B   ps,x

Proof of Theorem reiota2

Step	Hyp	Ref	Expression
1		ax-17 1317	. 2 |- (y e. B -> A.x y e. B)
2		ax-17 1317	. . 3 |- (ps -> A.xps)
3	2	a1i 8	. 2 |- (B e. A -> (ps -> A.xps))
4		reiota2.1	. 2 |- (x = B -> (ph <-> ps))
5	1, 3, 4	reiota2f 5109	1 |- ((B e. A /\ E!x e. A ph) -> (ps <-> (iotax(x e. A /\ ph)) = B))

Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240  A.wal 1296   = wceq 1298   e. wcel 1300  E!wreu 2107  iotacio 5087

This theorem is referenced by:  grpidinv2NEW 17119  grpinvNEW 17128  ringidmlemNEW 17153

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-un 3790

This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-rex 2110  df-reu 2111  df-v 2294  df-sbc 2454  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-uni 3178  df-iota 5089

Copyright terms: Public domain