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

Theorem ralidm 1774
Description: Idempotent law for restricted quantifier.
Assertion
Ref Expression
ralidm |- (A.x e. A A.x e. A ph <-> A.x e. A ph)
Distinct variable group(s):   x,A

Proof of Theorem ralidm
StepHypRef Expression
1 pm5.1 501 . . 3 |- ((A.x e. A A.x e. A ph /\ A.x e. A ph) -> (A.x e. A A.x e. A ph <-> A.x e. A ph))
2 rzal 1773 . . 3 |- (A = (/) -> A.x e. A A.x e. A ph)
3 rzal 1773 . . 3 |- (A = (/) -> A.x e. A ph)
41, 2, 3sylanc 361 . 2 |- (A = (/) -> (A.x e. A A.x e. A ph <-> A.x e. A ph))
5 n0 1714 . . 3 |- (-. A = (/) <-> E.x x e. A)
6 biimt 549 . . . 4 |- (E.x x e. A -> (A.x e. A ph <-> (E.x x e. A -> A.x e. A ph)))
7 df-ral 1205 . . . . 5 |- (A.x e. A A.x e. A ph <-> A.x(x e. A -> A.x e. A ph))
8 hbra1 1237 . . . . . 6 |- (A.x e. A ph -> A.xA.x e. A ph)
9819.23 745 . . . . 5 |- (A.x(x e. A -> A.x e. A ph) <-> (E.x x e. A -> A.x e. A ph))
107, 9bitr 151 . . . 4 |- (A.x e. A A.x e. A ph <-> (E.x x e. A -> A.x e. A ph))
116, 10syl6rbbr 417 . . 3 |- (E.x x e. A -> (A.x e. A A.x e. A ph <-> A.x e. A ph))
125, 11sylbi 174 . 2 |- (-. A = (/) -> (A.x e. A A.x e. A ph <-> A.x e. A ph))
134, 12pm2.61i 110 1 |- (A.x e. A A.x e. A ph <-> A.x e. A ph)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127  A.wal 672  E.wex 678   = wceq 1091   e. wcel 1092  A.wral 1201  (/)c0 1707
This theorem is referenced by:  dfwe2 2187
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-v 1349  df-dif 1489  df-nul 1708
metamath.org