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

Theorem nfiung 4984
Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 2404. See nfiun 4982 for a version with more disjoint variable conditions, but not requiring ax-13 2404. (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 4952 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
2 nfiung.1 . . . 4 𝑦𝐴
3 nfiung.2 . . . . 5 𝑦𝐵
43nfcri 2917 . . . 4 𝑦 𝑧𝐵
52, 4nfrex 3363 . . 3 𝑦𝑥𝐴 𝑧𝐵
65nfabg 2932 . 2 𝑦{𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
71, 6nfcxfr 2923 1 𝑦 𝑥𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wcel 2143  {cab 2741  wnfc 2910  wrex 3087   ciun 4950
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404  ax-ext 2735
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1564  df-ex 1801  df-nf 1805  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3078  df-rex 3088  df-iun 4952
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator