ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iinin2m GIF version

Theorem iinin2m 3775
Description: Indexed intersection of intersection. Compare to Theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Jim Kingdon, 17-Aug-2018.)
Assertion
Ref Expression
iinin2m (∃𝑥 𝑥𝐴 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iinin2m
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 r19.28mv 3358 . . . 4 (∃𝑥 𝑥𝐴 → (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶)))
2 elin 3169 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
32ralbii 2380 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
4 vex 2617 . . . . . 6 𝑦 ∈ V
5 eliin 3712 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
64, 5ax-mp 7 . . . . 5 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
76anbi2i 445 . . . 4 ((𝑦𝐵𝑦 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶))
81, 3, 73bitr4g 221 . . 3 (∃𝑥 𝑥𝐴 → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶)))
9 eliin 3712 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
104, 9ax-mp 7 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
11 elin 3169 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶))
128, 10, 113bitr4g 221 . 2 (∃𝑥 𝑥𝐴 → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶)))
1312eqrdv 2083 1 (∃𝑥 𝑥𝐴 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1287  wex 1424  wcel 1436  wral 2355  Vcvv 2614  cin 2985   ciin 3708
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067
This theorem depends on definitions:  df-bi 115  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ral 2360  df-v 2616  df-in 2992  df-iin 3710
This theorem is referenced by:  iinin1m  3776
  Copyright terms: Public domain W3C validator