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

Theorem ceqsralt 2849
Description: Restricted quantifier version of ceqsalt 2848. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
Assertion
Ref Expression
ceqsralt ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 = 𝐴 → 𝜑) ↔ 𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem ceqsralt
StepHypRef Expression
1 df-ral 2533 . . . 4 (∀𝑥 ∈ 𝐵 (𝑥 = 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)))
2 eleq1 2301 . . . . . . . . 9 (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
32pm5.32ri 459 . . . . . . . 8 ((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ (𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴))
43imbi1i 238 . . . . . . 7 (((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴) → 𝜑) ↔ ((𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴) → 𝜑))
5 impexp 263 . . . . . . 7 (((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴) → 𝜑) ↔ (𝑥 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)))
6 impexp 263 . . . . . . 7 (((𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴) → 𝜑) ↔ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)))
74, 5, 63bitr3i 210 . . . . . 6 ((𝑥 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)) ↔ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)))
87albii 1523 . . . . 5 (∀𝑥(𝑥 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)) ↔ ∀𝑥(𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)))
98a1i 9 . . . 4 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥(𝑥 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)) ↔ ∀𝑥(𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑))))
101, 9bitrid 192 . . 3 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 = 𝐴 → 𝜑) ↔ ∀𝑥(𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑))))
11 19.21v 1926 . . 3 (∀𝑥(𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝜑)) ↔ (𝐴 ∈ 𝐵 → ∀𝑥(𝑥 = 𝐴 → 𝜑)))
1210, 11bitrdi 196 . 2 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 = 𝐴 → 𝜑) ↔ (𝐴 ∈ 𝐵 → ∀𝑥(𝑥 = 𝐴 → 𝜑))))
13 biimt 241 . . 3 (𝐴 ∈ 𝐵 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ (𝐴 ∈ 𝐵 → ∀𝑥(𝑥 = 𝐴 → 𝜑))))
14133ad2ant3 1051 . 2 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ (𝐴 ∈ 𝐵 → ∀𝑥(𝑥 = 𝐴 → 𝜑))))
15 ceqsalt 2848 . 2 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ 𝜓))
1612, 14, 153bitr2d 216 1 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) ∧ 𝐴 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝑥 = 𝐴 → 𝜑) ↔ 𝜓))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009  ∀wal 1400   = wceq 1402  Ⅎwnf 1513   ∈ wcel 2209  ∀wral 2528
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-ral 2533  df-v 2823
This theorem is used by:  ceqsralv  2853
  Copyright terms: Public domain W3C validator