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

Theorem ituniiun 9923
Description: Unwrap an iterated union from the "other end". (Contributed by Stefan O'Rear, 11-Feb-2015.)
Hypothesis
Ref Expression
ituni.u 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
Assertion
Ref Expression
ituniiun (𝐴𝑉 → ((𝑈𝐴)‘suc 𝐵) = 𝑎𝐴 ((𝑈𝑎)‘𝐵))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑎   𝑥,𝐵,𝑦,𝑎   𝑈,𝑎
Allowed substitution hints:   𝑈(𝑥,𝑦)   𝑉(𝑥,𝑦,𝑎)

Proof of Theorem ituniiun
Dummy variables 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6675 . . . 4 (𝑏 = 𝐴 → (𝑈𝑏) = (𝑈𝐴))
21fveq1d 6677 . . 3 (𝑏 = 𝐴 → ((𝑈𝑏)‘suc 𝐵) = ((𝑈𝐴)‘suc 𝐵))
3 iuneq1 4898 . . 3 (𝑏 = 𝐴 𝑎𝑏 ((𝑈𝑎)‘𝐵) = 𝑎𝐴 ((𝑈𝑎)‘𝐵))
42, 3eqeq12d 2754 . 2 (𝑏 = 𝐴 → (((𝑈𝑏)‘suc 𝐵) = 𝑎𝑏 ((𝑈𝑎)‘𝐵) ↔ ((𝑈𝐴)‘suc 𝐵) = 𝑎𝐴 ((𝑈𝑎)‘𝐵)))
5 suceq 6238 . . . . . 6 (𝑑 = ∅ → suc 𝑑 = suc ∅)
65fveq2d 6679 . . . . 5 (𝑑 = ∅ → ((𝑈𝑏)‘suc 𝑑) = ((𝑈𝑏)‘suc ∅))
7 fveq2 6675 . . . . . 6 (𝑑 = ∅ → ((𝑈𝑎)‘𝑑) = ((𝑈𝑎)‘∅))
87iuneq2d 4911 . . . . 5 (𝑑 = ∅ → 𝑎𝑏 ((𝑈𝑎)‘𝑑) = 𝑎𝑏 ((𝑈𝑎)‘∅))
96, 8eqeq12d 2754 . . . 4 (𝑑 = ∅ → (((𝑈𝑏)‘suc 𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝑑) ↔ ((𝑈𝑏)‘suc ∅) = 𝑎𝑏 ((𝑈𝑎)‘∅)))
10 suceq 6238 . . . . . 6 (𝑑 = 𝑐 → suc 𝑑 = suc 𝑐)
1110fveq2d 6679 . . . . 5 (𝑑 = 𝑐 → ((𝑈𝑏)‘suc 𝑑) = ((𝑈𝑏)‘suc 𝑐))
12 fveq2 6675 . . . . . 6 (𝑑 = 𝑐 → ((𝑈𝑎)‘𝑑) = ((𝑈𝑎)‘𝑐))
1312iuneq2d 4911 . . . . 5 (𝑑 = 𝑐 𝑎𝑏 ((𝑈𝑎)‘𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝑐))
1411, 13eqeq12d 2754 . . . 4 (𝑑 = 𝑐 → (((𝑈𝑏)‘suc 𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝑑) ↔ ((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐)))
15 suceq 6238 . . . . . 6 (𝑑 = suc 𝑐 → suc 𝑑 = suc suc 𝑐)
1615fveq2d 6679 . . . . 5 (𝑑 = suc 𝑐 → ((𝑈𝑏)‘suc 𝑑) = ((𝑈𝑏)‘suc suc 𝑐))
17 fveq2 6675 . . . . . 6 (𝑑 = suc 𝑐 → ((𝑈𝑎)‘𝑑) = ((𝑈𝑎)‘suc 𝑐))
1817iuneq2d 4911 . . . . 5 (𝑑 = suc 𝑐 𝑎𝑏 ((𝑈𝑎)‘𝑑) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐))
1916, 18eqeq12d 2754 . . . 4 (𝑑 = suc 𝑐 → (((𝑈𝑏)‘suc 𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝑑) ↔ ((𝑈𝑏)‘suc suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐)))
20 suceq 6238 . . . . . 6 (𝑑 = 𝐵 → suc 𝑑 = suc 𝐵)
2120fveq2d 6679 . . . . 5 (𝑑 = 𝐵 → ((𝑈𝑏)‘suc 𝑑) = ((𝑈𝑏)‘suc 𝐵))
22 fveq2 6675 . . . . . 6 (𝑑 = 𝐵 → ((𝑈𝑎)‘𝑑) = ((𝑈𝑎)‘𝐵))
2322iuneq2d 4911 . . . . 5 (𝑑 = 𝐵 𝑎𝑏 ((𝑈𝑎)‘𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝐵))
2421, 23eqeq12d 2754 . . . 4 (𝑑 = 𝐵 → (((𝑈𝑏)‘suc 𝑑) = 𝑎𝑏 ((𝑈𝑎)‘𝑑) ↔ ((𝑈𝑏)‘suc 𝐵) = 𝑎𝑏 ((𝑈𝑎)‘𝐵)))
25 uniiun 4945 . . . . 5 𝑏 = 𝑎𝑏 𝑎
26 ituni.u . . . . . . 7 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
2726itunisuc 9920 . . . . . 6 ((𝑈𝑏)‘suc ∅) = ((𝑈𝑏)‘∅)
2826ituni0 9919 . . . . . . . 8 (𝑏 ∈ V → ((𝑈𝑏)‘∅) = 𝑏)
2928elv 3404 . . . . . . 7 ((𝑈𝑏)‘∅) = 𝑏
3029unieqi 4810 . . . . . 6 ((𝑈𝑏)‘∅) = 𝑏
3127, 30eqtri 2761 . . . . 5 ((𝑈𝑏)‘suc ∅) = 𝑏
3226ituni0 9919 . . . . . 6 (𝑎𝑏 → ((𝑈𝑎)‘∅) = 𝑎)
3332iuneq2i 4903 . . . . 5 𝑎𝑏 ((𝑈𝑎)‘∅) = 𝑎𝑏 𝑎
3425, 31, 333eqtr4i 2771 . . . 4 ((𝑈𝑏)‘suc ∅) = 𝑎𝑏 ((𝑈𝑎)‘∅)
3526itunisuc 9920 . . . . . 6 ((𝑈𝑏)‘suc suc 𝑐) = ((𝑈𝑏)‘suc 𝑐)
36 unieq 4808 . . . . . . 7 (((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐) → ((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐))
3726itunisuc 9920 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
3837a1i 11 . . . . . . . . 9 (𝑎𝑏 → ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐))
3938iuneq2i 4903 . . . . . . . 8 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐)
40 iuncom4 4890 . . . . . . . 8 𝑎𝑏 ((𝑈𝑎)‘𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐)
4139, 40eqtr2i 2762 . . . . . . 7 𝑎𝑏 ((𝑈𝑎)‘𝑐) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐)
4236, 41eqtrdi 2789 . . . . . 6 (((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐) → ((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐))
4335, 42syl5eq 2785 . . . . 5 (((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐) → ((𝑈𝑏)‘suc suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐))
4443a1i 11 . . . 4 (𝑐 ∈ ω → (((𝑈𝑏)‘suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘𝑐) → ((𝑈𝑏)‘suc suc 𝑐) = 𝑎𝑏 ((𝑈𝑎)‘suc 𝑐)))
459, 14, 19, 24, 34, 44finds 7630 . . 3 (𝐵 ∈ ω → ((𝑈𝑏)‘suc 𝐵) = 𝑎𝑏 ((𝑈𝑎)‘𝐵))
46 iun0 4948 . . . . 5 𝑎𝑏 ∅ = ∅
4746eqcomi 2747 . . . 4 ∅ = 𝑎𝑏
48 peano2b 7616 . . . . . 6 (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω)
49 vex 3402 . . . . . . . 8 𝑏 ∈ V
5026itunifn 9918 . . . . . . . 8 (𝑏 ∈ V → (𝑈𝑏) Fn ω)
51 fndm 6441 . . . . . . . 8 ((𝑈𝑏) Fn ω → dom (𝑈𝑏) = ω)
5249, 50, 51mp2b 10 . . . . . . 7 dom (𝑈𝑏) = ω
5352eleq2i 2824 . . . . . 6 (suc 𝐵 ∈ dom (𝑈𝑏) ↔ suc 𝐵 ∈ ω)
5448, 53bitr4i 281 . . . . 5 (𝐵 ∈ ω ↔ suc 𝐵 ∈ dom (𝑈𝑏))
55 ndmfv 6705 . . . . 5 (¬ suc 𝐵 ∈ dom (𝑈𝑏) → ((𝑈𝑏)‘suc 𝐵) = ∅)
5654, 55sylnbi 333 . . . 4 𝐵 ∈ ω → ((𝑈𝑏)‘suc 𝐵) = ∅)
57 vex 3402 . . . . . . . 8 𝑎 ∈ V
5826itunifn 9918 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
59 fndm 6441 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
6057, 58, 59mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
6160eleq2i 2824 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
62 ndmfv 6705 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
6361, 62sylnbir 334 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
6463iuneq2d 4911 . . . 4 𝐵 ∈ ω → 𝑎𝑏 ((𝑈𝑎)‘𝐵) = 𝑎𝑏 ∅)
6547, 56, 643eqtr4a 2799 . . 3 𝐵 ∈ ω → ((𝑈𝑏)‘suc 𝐵) = 𝑎𝑏 ((𝑈𝑎)‘𝐵))
6645, 65pm2.61i 185 . 2 ((𝑈𝑏)‘suc 𝐵) = 𝑎𝑏 ((𝑈𝑎)‘𝐵)
674, 66vtoclg 3471 1 (𝐴𝑉 → ((𝑈𝐴)‘suc 𝐵) = 𝑎𝐴 ((𝑈𝑎)‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542  wcel 2113  Vcvv 3398  c0 4212   cuni 4797   ciun 4882  cmpt 5111  dom cdm 5526  cres 5528  suc csuc 6175   Fn wfn 6335  cfv 6340  ωcom 7600  reccrdg 8075
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710  ax-rep 5155  ax-sep 5168  ax-nul 5175  ax-pr 5297  ax-un 7480  ax-inf2 9178
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-reu 3060  df-rab 3062  df-v 3400  df-sbc 3683  df-csb 3792  df-dif 3847  df-un 3849  df-in 3851  df-ss 3861  df-pss 3863  df-nul 4213  df-if 4416  df-pw 4491  df-sn 4518  df-pr 4520  df-tp 4522  df-op 4524  df-uni 4798  df-iun 4884  df-br 5032  df-opab 5094  df-mpt 5112  df-tr 5138  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5484  df-we 5486  df-xp 5532  df-rel 5533  df-cnv 5534  df-co 5535  df-dm 5536  df-rn 5537  df-res 5538  df-ima 5539  df-pred 6130  df-ord 6176  df-on 6177  df-lim 6178  df-suc 6179  df-iota 6298  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-om 7601  df-wrecs 7977  df-recs 8038  df-rdg 8076
This theorem is referenced by:  hsmexlem4  9930
  Copyright terms: Public domain W3C validator