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

Theorem onovuni 8079
Description: A variant of onfununi 8078 for operations. (Contributed by Eric Schmidt, 26-May-2009.) (Revised by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
onovuni.1 (Lim 𝑦 → (𝐴𝐹𝑦) = 𝑥𝑦 (𝐴𝐹𝑥))
onovuni.2 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥𝑦) → (𝐴𝐹𝑥) ⊆ (𝐴𝐹𝑦))
Assertion
Ref Expression
onovuni ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → (𝐴𝐹 𝑆) = 𝑥𝑆 (𝐴𝐹𝑥))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦   𝑥,𝑆,𝑦   𝑥,𝑇
Allowed substitution hint:   𝑇(𝑦)

Proof of Theorem onovuni
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 onovuni.1 . . . 4 (Lim 𝑦 → (𝐴𝐹𝑦) = 𝑥𝑦 (𝐴𝐹𝑥))
2 oveq2 7221 . . . . . 6 (𝑧 = 𝑦 → (𝐴𝐹𝑧) = (𝐴𝐹𝑦))
3 eqid 2737 . . . . . 6 (𝑧 ∈ V ↦ (𝐴𝐹𝑧)) = (𝑧 ∈ V ↦ (𝐴𝐹𝑧))
4 ovex 7246 . . . . . 6 (𝐴𝐹𝑦) ∈ V
52, 3, 4fvmpt 6818 . . . . 5 (𝑦 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = (𝐴𝐹𝑦))
65elv 3414 . . . 4 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = (𝐴𝐹𝑦)
7 oveq2 7221 . . . . . . . 8 (𝑧 = 𝑥 → (𝐴𝐹𝑧) = (𝐴𝐹𝑥))
8 ovex 7246 . . . . . . . 8 (𝐴𝐹𝑥) ∈ V
97, 3, 8fvmpt 6818 . . . . . . 7 (𝑥 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
109elv 3414 . . . . . 6 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥)
1110a1i 11 . . . . 5 (𝑥𝑦 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
1211iuneq2i 4925 . . . 4 𝑥𝑦 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑦 (𝐴𝐹𝑥)
131, 6, 123eqtr4g 2803 . . 3 (Lim 𝑦 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = 𝑥𝑦 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥))
14 onovuni.2 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥𝑦) → (𝐴𝐹𝑥) ⊆ (𝐴𝐹𝑦))
1514, 10, 63sstr4g 3946 . . 3 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥𝑦) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) ⊆ ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦))
1613, 15onfununi 8078 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥))
17 uniexg 7528 . . . 4 (𝑆𝑇 𝑆 ∈ V)
18 oveq2 7221 . . . . 5 (𝑧 = 𝑆 → (𝐴𝐹𝑧) = (𝐴𝐹 𝑆))
19 ovex 7246 . . . . 5 (𝐴𝐹 𝑆) ∈ V
2018, 3, 19fvmpt 6818 . . . 4 ( 𝑆 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
2117, 20syl 17 . . 3 (𝑆𝑇 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
22213ad2ant1 1135 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
2310a1i 11 . . . 4 (𝑥𝑆 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
2423iuneq2i 4925 . . 3 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑆 (𝐴𝐹𝑥)
2524a1i 11 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑆 (𝐴𝐹𝑥))
2616, 22, 253eqtr3d 2785 1 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → (𝐴𝐹 𝑆) = 𝑥𝑆 (𝐴𝐹𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1089   = wceq 1543  wcel 2110  wne 2940  Vcvv 3408  wss 3866  c0 4237   cuni 4819   ciun 4904  cmpt 5135  Oncon0 6213  Lim wlim 6214  cfv 6380  (class class class)co 7213
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-ord 6216  df-on 6217  df-lim 6218  df-iota 6338  df-fun 6382  df-fv 6388  df-ov 7216
This theorem is referenced by:  onoviun  8080
  Copyright terms: Public domain W3C validator