Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  inixp Structured version   Visualization version   GIF version

Theorem inixp 34011
Description: Intersection of Cartesian products over the same base set. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
inixp (X𝑥𝐴 𝐵X𝑥𝐴 𝐶) = X𝑥𝐴 (𝐵𝐶)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem inixp
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 an4 647 . . . 4 (((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ ((𝑓 Fn 𝐴𝑓 Fn 𝐴) ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
2 anidm 561 . . . . 5 ((𝑓 Fn 𝐴𝑓 Fn 𝐴) ↔ 𝑓 Fn 𝐴)
3 r19.26 3245 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
4 elin 3994 . . . . . . . 8 ((𝑓𝑥) ∈ (𝐵𝐶) ↔ ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
54bicomi 216 . . . . . . 7 (((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (𝑓𝑥) ∈ (𝐵𝐶))
65ralbii 3161 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶))
73, 6bitr3i 269 . . . . 5 ((∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶) ↔ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶))
82, 7anbi12i 621 . . . 4 (((𝑓 Fn 𝐴𝑓 Fn 𝐴) ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
91, 8bitri 267 . . 3 (((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
10 vex 3388 . . . . 5 𝑓 ∈ V
1110elixp 8155 . . . 4 (𝑓X𝑥𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵))
1210elixp 8155 . . . 4 (𝑓X𝑥𝐴 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
1311, 12anbi12i 621 . . 3 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
1410elixp 8155 . . 3 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
159, 13, 143bitr4i 295 . 2 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ 𝑓X𝑥𝐴 (𝐵𝐶))
1615ineqri 4004 1 (X𝑥𝐴 𝐵X𝑥𝐴 𝐶) = X𝑥𝐴 (𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:  wa 385   = wceq 1653  wcel 2157  wral 3089  cin 3768   Fn wfn 6096  cfv 6101  Xcixp 8148
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-rex 3095  df-rab 3098  df-v 3387  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-br 4844  df-opab 4906  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-iota 6064  df-fun 6103  df-fn 6104  df-fv 6109  df-ixp 8149
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator