Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  unopab Structured version   Unicode version

Theorem unopab 3827
 Description: Union of two ordered pair class abstractions. (Contributed by NM, 30-Sep-2002.)
Assertion
Ref Expression
unopab

Proof of Theorem unopab
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 unab 3198 . . 3
2 19.43 1516 . . . . 5
3 andi 730 . . . . . . . 8
43exbii 1493 . . . . . . 7
5 19.43 1516 . . . . . . 7
64, 5bitr2i 174 . . . . . 6
76exbii 1493 . . . . 5
82, 7bitr3i 175 . . . 4
98abbii 2150 . . 3
101, 9eqtri 2057 . 2
11 df-opab 3810 . . 3
12 df-opab 3810 . . 3
1311, 12uneq12i 3089 . 2
14 df-opab 3810 . 2
1510, 13, 143eqtr4i 2067 1
 Colors of variables: wff set class Syntax hints:   wa 97   wo 628   wceq 1242  wex 1378  cab 2023   cun 2909  cop 3370  copab 3808 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019 This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-v 2553  df-un 2916  df-opab 3810 This theorem is referenced by:  xpundi  4339  xpundir  4340  cnvun  4672  coundi  4765  coundir  4766  mptun  4972
 Copyright terms: Public domain W3C validator