MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2ax6e Unicode version

Theorem 2ax6e 2194
Description: We can always find values matching and , as long as they are represented by distinct variables. Version of 2ax6elem 2193 with a distinct variable constraint. (Contributed by Wolf Lammen, 28-Sep-2018.)
Assertion
Ref Expression
2ax6e
Distinct variable group:   ,

Proof of Theorem 2ax6e
StepHypRef Expression
1 aev 1943 . . . . 5
2119.21bi 1869 . . . 4
3 aev 1943 . . . . 5
4319.21bi 1869 . . . 4
52, 4jca 532 . . 3
6 19.8a 1857 . . 3
7 19.8a 1857 . . 3
85, 6, 73syl 20 . 2
9 2ax6elem 2193 . 2
108, 9pm2.61i 164 1
Colors of variables: wff setvar class
Syntax hints:  /\wa 369  A.wal 1393  E.wex 1612
This theorem is referenced by:  2sb5rf  2195  2sb6rf  2196
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1613  df-nf 1617
  Copyright terms: Public domain W3C validator