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

Theorem boxriin 8979
Description: A rectangular subset of a rectangular set can be recovered as the relative intersection of single-axis restrictions. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Assertion
Ref Expression
boxriin (∀𝑥𝐼 𝐴𝐵X𝑥𝐼 𝐴 = (X𝑥𝐼 𝐵 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)))
Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝐼,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem boxriin
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 simprl 771 . . . . 5 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → 𝑧 Fn 𝐼)
2 ssel 3989 . . . . . . . 8 (𝐴𝐵 → ((𝑧𝑥) ∈ 𝐴 → (𝑧𝑥) ∈ 𝐵))
32ral2imi 3083 . . . . . . 7 (∀𝑥𝐼 𝐴𝐵 → (∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴 → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵))
43adantr 480 . . . . . 6 ((∀𝑥𝐼 𝐴𝐵𝑧 Fn 𝐼) → (∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴 → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵))
54impr 454 . . . . 5 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵)
6 eleq2 2828 . . . . . . . . . . . 12 (𝐴 = if(𝑥 = 𝑦, 𝐴, 𝐵) → ((𝑧𝑥) ∈ 𝐴 ↔ (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
7 eleq2 2828 . . . . . . . . . . . 12 (𝐵 = if(𝑥 = 𝑦, 𝐴, 𝐵) → ((𝑧𝑥) ∈ 𝐵 ↔ (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
8 simplr 769 . . . . . . . . . . . 12 (((𝐴𝐵 ∧ (𝑧𝑥) ∈ 𝐴) ∧ 𝑥 = 𝑦) → (𝑧𝑥) ∈ 𝐴)
9 ssel2 3990 . . . . . . . . . . . . 13 ((𝐴𝐵 ∧ (𝑧𝑥) ∈ 𝐴) → (𝑧𝑥) ∈ 𝐵)
109adantr 480 . . . . . . . . . . . 12 (((𝐴𝐵 ∧ (𝑧𝑥) ∈ 𝐴) ∧ ¬ 𝑥 = 𝑦) → (𝑧𝑥) ∈ 𝐵)
116, 7, 8, 10ifbothda 4569 . . . . . . . . . . 11 ((𝐴𝐵 ∧ (𝑧𝑥) ∈ 𝐴) → (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))
1211ex 412 . . . . . . . . . 10 (𝐴𝐵 → ((𝑧𝑥) ∈ 𝐴 → (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
1312ral2imi 3083 . . . . . . . . 9 (∀𝑥𝐼 𝐴𝐵 → (∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴 → ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
1413adantr 480 . . . . . . . 8 ((∀𝑥𝐼 𝐴𝐵𝑧 Fn 𝐼) → (∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴 → ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
1514impr 454 . . . . . . 7 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))
161, 15jca 511 . . . . . 6 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
1716ralrimivw 3148 . . . . 5 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
181, 5, 17jca31 514 . . . 4 ((∀𝑥𝐼 𝐴𝐵 ∧ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)) → ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))))
19 simprll 779 . . . . 5 ((∀𝑥𝐼 𝐴𝐵 ∧ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))) → 𝑧 Fn 𝐼)
20 simpr 484 . . . . . . . 8 ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)) → ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))
2120ralimi 3081 . . . . . . 7 (∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)) → ∀𝑦𝐼𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))
22 ralcom 3287 . . . . . . . 8 (∀𝑦𝐼𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ ∀𝑥𝐼𝑦𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))
23 iftrue 4537 . . . . . . . . . . . 12 (𝑥 = 𝑦 → if(𝑥 = 𝑦, 𝐴, 𝐵) = 𝐴)
2423equcoms 2017 . . . . . . . . . . 11 (𝑦 = 𝑥 → if(𝑥 = 𝑦, 𝐴, 𝐵) = 𝐴)
2524eleq2d 2825 . . . . . . . . . 10 (𝑦 = 𝑥 → ((𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ (𝑧𝑥) ∈ 𝐴))
2625rspcva 3620 . . . . . . . . 9 ((𝑥𝐼 ∧ ∀𝑦𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)) → (𝑧𝑥) ∈ 𝐴)
2726ralimiaa 3080 . . . . . . . 8 (∀𝑥𝐼𝑦𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵) → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)
2822, 27sylbi 217 . . . . . . 7 (∀𝑦𝐼𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵) → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)
2921, 28syl 17 . . . . . 6 (∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)) → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)
3029ad2antll 729 . . . . 5 ((∀𝑥𝐼 𝐴𝐵 ∧ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))) → ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴)
3119, 30jca 511 . . . 4 ((∀𝑥𝐼 𝐴𝐵 ∧ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))) → (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴))
3218, 31impbida 801 . . 3 (∀𝑥𝐼 𝐴𝐵 → ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴) ↔ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))))
33 vex 3482 . . . 4 𝑧 ∈ V
3433elixp 8943 . . 3 (𝑧X𝑥𝐼 𝐴 ↔ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐴))
35 elin 3979 . . . 4 (𝑧 ∈ (X𝑥𝐼 𝐵 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)) ↔ (𝑧X𝑥𝐼 𝐵𝑧 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)))
3633elixp 8943 . . . . 5 (𝑧X𝑥𝐼 𝐵 ↔ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵))
37 eliin 5001 . . . . . . 7 (𝑧 ∈ V → (𝑧 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ ∀𝑦𝐼 𝑧X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)))
3837elv 3483 . . . . . 6 (𝑧 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ ∀𝑦𝐼 𝑧X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵))
3933elixp 8943 . . . . . . 7 (𝑧X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
4039ralbii 3091 . . . . . 6 (∀𝑦𝐼 𝑧X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
4138, 40bitri 275 . . . . 5 (𝑧 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵) ↔ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵)))
4236, 41anbi12i 628 . . . 4 ((𝑧X𝑥𝐼 𝐵𝑧 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)) ↔ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))))
4335, 42bitri 275 . . 3 (𝑧 ∈ (X𝑥𝐼 𝐵 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)) ↔ ((𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ 𝐵) ∧ ∀𝑦𝐼 (𝑧 Fn 𝐼 ∧ ∀𝑥𝐼 (𝑧𝑥) ∈ if(𝑥 = 𝑦, 𝐴, 𝐵))))
4432, 34, 433bitr4g 314 . 2 (∀𝑥𝐼 𝐴𝐵 → (𝑧X𝑥𝐼 𝐴𝑧 ∈ (X𝑥𝐼 𝐵 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵))))
4544eqrdv 2733 1 (∀𝑥𝐼 𝐴𝐵X𝑥𝐼 𝐴 = (X𝑥𝐼 𝐵 𝑦𝐼 X𝑥𝐼 if(𝑥 = 𝑦, 𝐴, 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1537  wcel 2106  wral 3059  Vcvv 3478  cin 3962  wss 3963  ifcif 4531   ciin 4997   Fn wfn 6558  cfv 6563  Xcixp 8936
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-11 2155  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iin 4999  df-br 5149  df-opab 5211  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fun 6565  df-fn 6566  df-fv 6571  df-ixp 8937
This theorem is referenced by:  ptcld  23637  kelac1  43052
  Copyright terms: Public domain W3C validator