Mathbox for Jonathan Ben-Naim < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1146 Structured version   Visualization version   GIF version

Theorem bnj1146 32171
 Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj1146.1 (𝑦𝐴 → ∀𝑥 𝑦𝐴)
Assertion
Ref Expression
bnj1146 𝑥𝐴 𝐵𝐵
Distinct variable groups:   𝑦,𝐴   𝑥,𝐵,𝑦
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem bnj1146
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 nfv 1915 . . . . . 6 𝑦(𝑥𝐴𝑤𝐵)
2 bnj1146.1 . . . . . . . 8 (𝑦𝐴 → ∀𝑥 𝑦𝐴)
32nf5i 2148 . . . . . . 7 𝑥 𝑦𝐴
4 nfv 1915 . . . . . . 7 𝑥 𝑤𝐵
53, 4nfan 1900 . . . . . 6 𝑥(𝑦𝐴𝑤𝐵)
6 eleq1w 2875 . . . . . . 7 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
76anbi1d 632 . . . . . 6 (𝑥 = 𝑦 → ((𝑥𝐴𝑤𝐵) ↔ (𝑦𝐴𝑤𝐵)))
81, 5, 7cbvexv1 2354 . . . . 5 (∃𝑥(𝑥𝐴𝑤𝐵) ↔ ∃𝑦(𝑦𝐴𝑤𝐵))
9 df-rex 3115 . . . . 5 (∃𝑥𝐴 𝑤𝐵 ↔ ∃𝑥(𝑥𝐴𝑤𝐵))
10 df-rex 3115 . . . . 5 (∃𝑦𝐴 𝑤𝐵 ↔ ∃𝑦(𝑦𝐴𝑤𝐵))
118, 9, 103bitr4i 306 . . . 4 (∃𝑥𝐴 𝑤𝐵 ↔ ∃𝑦𝐴 𝑤𝐵)
1211abbii 2866 . . 3 {𝑤 ∣ ∃𝑥𝐴 𝑤𝐵} = {𝑤 ∣ ∃𝑦𝐴 𝑤𝐵}
13 df-iun 4886 . . 3 𝑥𝐴 𝐵 = {𝑤 ∣ ∃𝑥𝐴 𝑤𝐵}
14 df-iun 4886 . . 3 𝑦𝐴 𝐵 = {𝑤 ∣ ∃𝑦𝐴 𝑤𝐵}
1512, 13, 143eqtr4i 2834 . 2 𝑥𝐴 𝐵 = 𝑦𝐴 𝐵
16 bnj1143 32170 . 2 𝑦𝐴 𝐵𝐵
1715, 16eqsstri 3952 1 𝑥𝐴 𝐵𝐵
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536  ∃wex 1781   ∈ wcel 2112  {cab 2779  ∃wrex 3110   ⊆ wss 3884  ∪ ciun 4884 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-v 3446  df-dif 3887  df-in 3891  df-ss 3901  df-nul 4247  df-iun 4886 This theorem is referenced by:  bnj1145  32373
 Copyright terms: Public domain W3C validator