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

Theorem abexex 5753
 Description: A condition where a class builder continues to exist after its wff is existentially quantified. (Contributed by NM, 4-Mar-2007.)
Hypotheses
Ref Expression
abexex.1
abexex.2
abexex.3
Assertion
Ref Expression
abexex
Distinct variable group:   ,,
Allowed substitution hints:   (,)

Proof of Theorem abexex
StepHypRef Expression
1 df-rex 2312 . . . 4
2 abexex.2 . . . . . 6
32pm4.71ri 372 . . . . 5
43exbii 1496 . . . 4
51, 4bitr4i 176 . . 3
65abbii 2153 . 2
7 abexex.1 . . 3
8 abexex.3 . . 3
97, 8abrexex2 5751 . 2
106, 9eqeltrri 2111 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 97  wex 1381   wcel 1393  cab 2026  wrex 2307  cvv 2557 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 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator