HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem 2mos 1448
Description: Double "exists at most one" with implicit substitution.
Hypothesis
Ref Expression
2mos.1 |- ((x = z /\ y = w) -> (ph <-> ps))
Assertion
Ref Expression
2mos |- (E.zE.wA.xA.y(ph -> (x = z /\ y = w)) <-> A.xA.yA.zA.w((ph /\ ps) -> (x = z /\ y = w)))
Distinct variable groups:   z,w,ph   x,y,ps   x,z,w,y

Proof of Theorem 2mos
StepHypRef Expression
1 2mo 1447 . 2 |- (E.zE.wA.xA.y(ph -> (x = z /\ y = w)) <-> A.xA.yA.zA.w((ph /\ [z / x][w / y]ph) -> (x = z /\ y = w)))
2 ax-17 971 . . . . . . 7 |- (ps -> A.xps)
3 ax-17 971 . . . . . . . . . 10 |- (x = z -> A.y x = z)
43sb19.21 1236 . . . . . . . . 9 |- ([w / y](x = z -> ph) <-> (x = z -> [w / y]ph))
5 ax-17 971 . . . . . . . . . 10 |- ((x = z -> ps) -> A.y(x = z -> ps))
6 2mos.1 . . . . . . . . . . . 12 |- ((x = z /\ y = w) -> (ph <-> ps))
76expcom 374 . . . . . . . . . . 11 |- (y = w -> (x = z -> (ph <-> ps)))
87pm5.74d 585 . . . . . . . . . 10 |- (y = w -> ((x = z -> ph) <-> (x = z -> ps)))
95, 8sbie 1196 . . . . . . . . 9 |- ([w / y](x = z -> ph) <-> (x = z -> ps))
104, 9bitr3 175 . . . . . . . 8 |- ((x = z -> [w / y]ph) <-> (x = z -> ps))
1110pm5.74ri 587 . . . . . . 7 |- (x = z -> ([w / y]ph <-> ps))
122, 11sbie 1196 . . . . . 6 |- ([z / x][w / y]ph <-> ps)
1312anbi2i 480 . . . . 5 |- ((ph /\ [z / x][w / y]ph) <-> (ph /\ ps))
1413imbi1i 186 . . . 4 |- (((ph /\ [z / x][w / y]ph) -> (x = z /\ y = w)) <-> ((ph /\ ps) -> (x = z /\ y = w)))
15142albii 1000 . . 3 |- (A.zA.w((ph /\ [z / x][w / y]ph) -> (x = z /\ y = w)) <-> A.zA.w((ph /\ ps) -> (x = z /\ y = w)))
16152albii 1000 . 2 |- (A.xA.yA.zA.w((ph /\ [z / x][w / y]ph) -> (x = z /\ y = w)) <-> A.xA.yA.zA.w((ph /\ ps) -> (x = z /\ y = w)))
171, 16bitr 173 1 |- (E.zE.wA.xA.y(ph -> (x = z /\ y = w)) <-> A.xA.yA.zA.w((ph /\ ps) -> (x = z /\ y = w)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954   = wceq 956  E.wex 980
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172
Copyright terms: Public domain