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

Theorem onovuni 7822
Description: A variant of onfununi 7821 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 7015 . . . . . 6 (𝑧 = 𝑦 → (𝐴𝐹𝑧) = (𝐴𝐹𝑦))
3 eqid 2793 . . . . . 6 (𝑧 ∈ V ↦ (𝐴𝐹𝑧)) = (𝑧 ∈ V ↦ (𝐴𝐹𝑧))
4 ovex 7039 . . . . . 6 (𝐴𝐹𝑦) ∈ V
52, 3, 4fvmpt 6626 . . . . 5 (𝑦 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = (𝐴𝐹𝑦))
65elv 3437 . . . 4 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = (𝐴𝐹𝑦)
7 oveq2 7015 . . . . . . . 8 (𝑧 = 𝑥 → (𝐴𝐹𝑧) = (𝐴𝐹𝑥))
8 ovex 7039 . . . . . . . 8 (𝐴𝐹𝑥) ∈ V
97, 3, 8fvmpt 6626 . . . . . . 7 (𝑥 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
109elv 3437 . . . . . 6 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥)
1110a1i 11 . . . . 5 (𝑥𝑦 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
1211iuneq2i 4839 . . . 4 𝑥𝑦 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑦 (𝐴𝐹𝑥)
131, 6, 123eqtr4g 2854 . . 3 (Lim 𝑦 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦) = 𝑥𝑦 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥))
14 onovuni.2 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥𝑦) → (𝐴𝐹𝑥) ⊆ (𝐴𝐹𝑦))
1514, 10, 63sstr4g 3928 . . 3 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝑥𝑦) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) ⊆ ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑦))
1613, 15onfununi 7821 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥))
17 uniexg 7316 . . . 4 (𝑆𝑇 𝑆 ∈ V)
18 oveq2 7015 . . . . 5 (𝑧 = 𝑆 → (𝐴𝐹𝑧) = (𝐴𝐹 𝑆))
19 ovex 7039 . . . . 5 (𝐴𝐹 𝑆) ∈ V
2018, 3, 19fvmpt 6626 . . . 4 ( 𝑆 ∈ V → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
2117, 20syl 17 . . 3 (𝑆𝑇 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
22213ad2ant1 1124 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘ 𝑆) = (𝐴𝐹 𝑆))
2310a1i 11 . . . 4 (𝑥𝑆 → ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = (𝐴𝐹𝑥))
2423iuneq2i 4839 . . 3 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑆 (𝐴𝐹𝑥)
2524a1i 11 . 2 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → 𝑥𝑆 ((𝑧 ∈ V ↦ (𝐴𝐹𝑧))‘𝑥) = 𝑥𝑆 (𝐴𝐹𝑥))
2616, 22, 253eqtr3d 2837 1 ((𝑆𝑇𝑆 ⊆ On ∧ 𝑆 ≠ ∅) → (𝐴𝐹 𝑆) = 𝑥𝑆 (𝐴𝐹𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1078   = wceq 1520  wcel 2079  wne 2982  Vcvv 3432  wss 3854  c0 4206   cuni 4739   ciun 4819  cmpt 5035  Oncon0 6058  Lim wlim 6059  cfv 6217  (class class class)co 7007
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1775  ax-4 1789  ax-5 1886  ax-6 1945  ax-7 1990  ax-8 2081  ax-9 2089  ax-10 2110  ax-11 2124  ax-12 2139  ax-13 2342  ax-ext 2767  ax-sep 5088  ax-nul 5095  ax-pr 5214  ax-un 7310
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1079  df-3an 1080  df-tru 1523  df-ex 1760  df-nf 1764  df-sb 2041  df-mo 2574  df-eu 2610  df-clab 2774  df-cleq 2786  df-clel 2861  df-nfc 2933  df-ne 2983  df-ral 3108  df-rex 3109  df-rab 3112  df-v 3434  df-sbc 3702  df-dif 3857  df-un 3859  df-in 3861  df-ss 3869  df-pss 3871  df-nul 4207  df-if 4376  df-sn 4467  df-pr 4469  df-tp 4471  df-op 4473  df-uni 4740  df-iun 4821  df-br 4957  df-opab 5019  df-mpt 5036  df-tr 5058  df-id 5340  df-eprel 5345  df-po 5354  df-so 5355  df-fr 5394  df-we 5396  df-xp 5441  df-rel 5442  df-cnv 5443  df-co 5444  df-dm 5445  df-ord 6061  df-on 6062  df-lim 6063  df-iota 6181  df-fun 6219  df-fv 6225  df-ov 7010
This theorem is referenced by:  onoviun  7823
  Copyright terms: Public domain W3C validator