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

Theorem iunsuc 5724
Description: Inductive definition for the indexed union at a successor. (Contributed by Mario Carneiro, 4-Feb-2013.) (Proof shortened by Mario Carneiro, 18-Nov-2016.)
Hypotheses
Ref Expression
iunsuc.1 𝐴 ∈ V
iunsuc.2 (𝑥 = 𝐴𝐵 = 𝐶)
Assertion
Ref Expression
iunsuc 𝑥 ∈ suc 𝐴𝐵 = ( 𝑥𝐴 𝐵𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunsuc
StepHypRef Expression
1 df-suc 5646 . . 3 suc 𝐴 = (𝐴 ∪ {𝐴})
2 iuneq1 4470 . . 3 (suc 𝐴 = (𝐴 ∪ {𝐴}) → 𝑥 ∈ suc 𝐴𝐵 = 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵)
31, 2ax-mp 5 . 2 𝑥 ∈ suc 𝐴𝐵 = 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵
4 iunxun 4541 . 2 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 = ( 𝑥𝐴 𝐵 𝑥 ∈ {𝐴}𝐵)
5 iunsuc.1 . . . 4 𝐴 ∈ V
6 iunsuc.2 . . . 4 (𝑥 = 𝐴𝐵 = 𝐶)
75, 6iunxsn 4539 . . 3 𝑥 ∈ {𝐴}𝐵 = 𝐶
87uneq2i 3726 . 2 ( 𝑥𝐴 𝐵 𝑥 ∈ {𝐴}𝐵) = ( 𝑥𝐴 𝐵𝐶)
93, 4, 83eqtri 2636 1 𝑥 ∈ suc 𝐴𝐵 = ( 𝑥𝐴 𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1475  wcel 1977  Vcvv 3173  cun 3538  {csn 4125   ciun 4455  suc csuc 5642
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-v 3175  df-sbc 3403  df-un 3545  df-in 3547  df-ss 3554  df-sn 4126  df-iun 4457  df-suc 5646
This theorem is referenced by:  pwsdompw  8909
  Copyright terms: Public domain W3C validator