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

Theorem ovmptss 8102
Description: If all the values of the mapping are subsets of a class 𝑋, then so is any evaluation of the mapping. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
ovmptss.1 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
Assertion
Ref Expression
ovmptss (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 → (𝐸𝐹𝐺) ⊆ 𝑋)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥, 𝑦)   𝐸(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝐺(𝑥, 𝑦)

Proof of Theorem ovmptss
Dummy variables 𝑣 𝑢 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovmptss.1 . . . 4 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
2 mpomptsx 8073 . . . 4 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↦ ⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶)
31, 2eqtri 2784 . . 3 𝐹 = (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) ↦ ⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶)
43fvmptss 7004 . 2 (∀𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋 → (𝐹‘⟨𝐸, 𝐺⟩) ⊆ 𝑋)
5 vex 3455 . . . . . . . 8 𝑢 ∈ V
6 vex 3455 . . . . . . . 8 𝑣 ∈ V
75, 6op1std 8009 . . . . . . 7 (𝑧 = ⟨𝑢, 𝑣⟩ → (1st ‘𝑧) = 𝑢)
87csbeq1d 3851 . . . . . 6 (𝑧 = ⟨𝑢, 𝑣⟩ → ⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 = ⦋𝑢 / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶)
95, 6op2ndd 8010 . . . . . . . 8 (𝑧 = ⟨𝑢, 𝑣⟩ → (2nd ‘𝑧) = 𝑣)
109csbeq1d 3851 . . . . . . 7 (𝑧 = ⟨𝑢, 𝑣⟩ → ⦋(2nd ‘𝑧) / 𝑦⦌𝐶 = ⦋𝑣 / 𝑦⦌𝐶)
1110csbeq2dv 3854 . . . . . 6 (𝑧 = ⟨𝑢, 𝑣⟩ → ⦋𝑢 / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 = ⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶)
128, 11eqtrd 2796 . . . . 5 (𝑧 = ⟨𝑢, 𝑣⟩ → ⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 = ⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶)
1312sseq1d 3962 . . . 4 (𝑧 = ⟨𝑢, 𝑣⟩ → (⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋 ↔ ⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋))
1413raliunxp 5816 . . 3 (∀𝑧 ∈ ∪ 𝑢 ∈ 𝐴 ({𝑢} × ⦋𝑢 / 𝑥⦌𝐵)⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ ⦋ 𝑢 / 𝑥⦌𝐵⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋)
15 nfcv 2923 . . . . 5 Ⅎ𝑢({𝑥} × 𝐵)
16 nfcv 2923 . . . . . 6 Ⅎ𝑥{𝑢}
17 nfcsb1v 3871 . . . . . 6 Ⅎ𝑥⦋𝑢 / 𝑥⦌𝐵
1816, 17nfxp 5684 . . . . 5 Ⅎ𝑥({𝑢} × ⦋𝑢 / 𝑥⦌𝐵)
19 sneq 4594 . . . . . 6 (𝑥 = 𝑢 → {𝑥} = {𝑢})
20 csbeq1a 3861 . . . . . 6 (𝑥 = 𝑢 → 𝐵 = ⦋𝑢 / 𝑥⦌𝐵)
2119, 20xpeq12d 5682 . . . . 5 (𝑥 = 𝑢 → ({𝑥} × 𝐵) = ({𝑢} × ⦋𝑢 / 𝑥⦌𝐵))
2215, 18, 21cbviun 4993 . . . 4 ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵) = ∪ 𝑢 ∈ 𝐴 ({𝑢} × ⦋𝑢 / 𝑥⦌𝐵)
2322raleqi 3318 . . 3 (∀𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋 ↔ ∀𝑧 ∈ ∪ 𝑢 ∈ 𝐴 ({𝑢} × ⦋𝑢 / 𝑥⦌𝐵)⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋)
24 nfv 1947 . . . 4 Ⅎ𝑢∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋
25 nfcsb1v 3871 . . . . . 6 Ⅎ𝑥⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶
26 nfcv 2923 . . . . . 6 Ⅎ𝑥𝑋
2725, 26nfss 3924 . . . . 5 Ⅎ𝑥⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋
2817, 27nfralw 3310 . . . 4 Ⅎ𝑥∀𝑣 ∈ ⦋ 𝑢 / 𝑥⦌𝐵⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋
29 nfv 1947 . . . . . 6 Ⅎ𝑣 𝐶 ⊆ 𝑋
30 nfcsb1v 3871 . . . . . . 7 Ⅎ𝑦⦋𝑣 / 𝑦⦌𝐶
31 nfcv 2923 . . . . . . 7 Ⅎ𝑦𝑋
3230, 31nfss 3924 . . . . . 6 Ⅎ𝑦⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋
33 csbeq1a 3861 . . . . . . 7 (𝑦 = 𝑣 → 𝐶 = ⦋𝑣 / 𝑦⦌𝐶)
3433sseq1d 3962 . . . . . 6 (𝑦 = 𝑣 → (𝐶 ⊆ 𝑋 ↔ ⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋))
3529, 32, 34cbvralw 3305 . . . . 5 (∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 ↔ ∀𝑣 ∈ 𝐵 ⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋)
36 csbeq1a 3861 . . . . . . 7 (𝑥 = 𝑢 → ⦋𝑣 / 𝑦⦌𝐶 = ⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶)
3736sseq1d 3962 . . . . . 6 (𝑥 = 𝑢 → (⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋 ↔ ⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋))
3820, 37raleqbidv 3335 . . . . 5 (𝑥 = 𝑢 → (∀𝑣 ∈ 𝐵 ⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋 ↔ ∀𝑣 ∈ ⦋ 𝑢 / 𝑥⦌𝐵⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋))
3935, 38bitrid 286 . . . 4 (𝑥 = 𝑢 → (∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 ↔ ∀𝑣 ∈ ⦋ 𝑢 / 𝑥⦌𝐵⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋))
4024, 28, 39cbvralw 3305 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 ↔ ∀𝑢 ∈ 𝐴 ∀𝑣 ∈ ⦋ 𝑢 / 𝑥⦌𝐵⦋𝑢 / 𝑥⦌⦋𝑣 / 𝑦⦌𝐶 ⊆ 𝑋)
4114, 23, 403bitr4ri 307 . 2 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 ↔ ∀𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × 𝐵)⦋(1st ‘𝑧) / 𝑥⦌⦋(2nd ‘𝑧) / 𝑦⦌𝐶 ⊆ 𝑋)
42 df-ov 7421 . . 3 (𝐸𝐹𝐺) = (𝐹‘⟨𝐸, 𝐺⟩)
4342sseq1i 3959 . 2 ((𝐸𝐹𝐺) ⊆ 𝑋 ↔ (𝐹‘⟨𝐸, 𝐺⟩) ⊆ 𝑋)
444, 41, 433imtr4i 295 1 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ⊆ 𝑋 → (𝐸𝐹𝐺) ⊆ 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  ∀wral 3077  ⦋csb 3847   ⊆ wss 3899  {csn 4584  ⟨cop 4590  ∪ ciun 4951   ↦ cmpt 5186   × cxp 5649  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  1st c1st 7997  2nd c2nd 7998
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000
This theorem is used by:  relmpoopab  8103  relxpchom  18348  reldv  26183
  Copyright terms: Public domain W3C validator