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 37694
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 656 . . . 4 (((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ ((𝑓 Fn 𝐴𝑓 Fn 𝐴) ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
2 anidm 564 . . . . 5 ((𝑓 Fn 𝐴𝑓 Fn 𝐴) ↔ 𝑓 Fn 𝐴)
3 r19.26 3098 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
4 elin 3947 . . . . . . . 8 ((𝑓𝑥) ∈ (𝐵𝐶) ↔ ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
54bicomi 224 . . . . . . 7 (((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (𝑓𝑥) ∈ (𝐵𝐶))
65ralbii 3081 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶))
73, 6bitr3i 277 . . . . 5 ((∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶) ↔ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶))
82, 7anbi12i 628 . . . 4 (((𝑓 Fn 𝐴𝑓 Fn 𝐴) ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
91, 8bitri 275 . . 3 (((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
10 vex 3467 . . . . 5 𝑓 ∈ V
1110elixp 8926 . . . 4 (𝑓X𝑥𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵))
1210elixp 8926 . . . 4 (𝑓X𝑥𝐴 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
1311, 12anbi12i 628 . . 3 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
1410elixp 8926 . . 3 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
159, 13, 143bitr4i 303 . 2 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ 𝑓X𝑥𝐴 (𝐵𝐶))
1615ineqri 4192 1 (X𝑥𝐴 𝐵X𝑥𝐴 𝐶) = X𝑥𝐴 (𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1539  wcel 2107  wral 3050  cin 3930   Fn wfn 6536  cfv 6541  Xcixp 8919
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rab 3420  df-v 3465  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-br 5124  df-opab 5186  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-iota 6494  df-fun 6543  df-fn 6544  df-fv 6549  df-ixp 8920
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator