MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfiung Structured version   Visualization version   GIF version

Theorem nfiung 4944
Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 2389. See nfiun 4942 for a version with more disjoint variable conditions, but not requiring ax-13 2389. (Contributed by Mario Carneiro, 25-Jan-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfiung.1 𝑦𝐴
nfiung.2 𝑦𝐵
Assertion
Ref Expression
nfiung 𝑦 𝑥𝐴 𝐵

Proof of Theorem nfiung
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-iun 4914 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
2 nfiung.1 . . . 4 𝑦𝐴
3 nfiung.2 . . . . 5 𝑦𝐵
43nfcri 2970 . . . 4 𝑦 𝑧𝐵
52, 4nfrexg 3309 . . 3 𝑦𝑥𝐴 𝑧𝐵
65nfabg 2984 . 2 𝑦{𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
71, 6nfcxfr 2974 1 𝑦 𝑥𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wcel 2113  {cab 2798  wnfc 2960  wrex 3138   ciun 4912
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-13 2389  ax-ext 2792
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-iun 4914
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator