MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ralcom2 Structured version   Visualization version   GIF version

Theorem ralcom2 3319
Description: Commutation of restricted universal quantifiers. Note that 𝑥 and 𝑦 need not be disjoint (this makes the proof longer). This theorem relies on the full set of axioms up to ax-ext 2773 and it should no longer be used. Usage of ralcom 3310 is highly encouraged. (Contributed by NM, 24-Nov-1994.) (Proof shortened by Mario Carneiro, 17-Oct-2016.) (New usage is discouraged.)
Assertion
Ref Expression
ralcom2 (∀𝑥𝐴𝑦𝐴 𝜑 → ∀𝑦𝐴𝑥𝐴 𝜑)
Distinct variable groups:   𝑦,𝐴   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem ralcom2
StepHypRef Expression
1 eleq1w 2875 . . . . . . 7 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
21sps 2183 . . . . . 6 (∀𝑥 𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
32imbi1d 345 . . . . . . . . 9 (∀𝑥 𝑥 = 𝑦 → ((𝑥𝐴𝜑) ↔ (𝑦𝐴𝜑)))
43dral1 2453 . . . . . . . 8 (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥𝐴𝜑) ↔ ∀𝑦(𝑦𝐴𝜑)))
54bicomd 226 . . . . . . 7 (∀𝑥 𝑥 = 𝑦 → (∀𝑦(𝑦𝐴𝜑) ↔ ∀𝑥(𝑥𝐴𝜑)))
6 df-ral 3114 . . . . . . 7 (∀𝑦𝐴 𝜑 ↔ ∀𝑦(𝑦𝐴𝜑))
7 df-ral 3114 . . . . . . 7 (∀𝑥𝐴 𝜑 ↔ ∀𝑥(𝑥𝐴𝜑))
85, 6, 73bitr4g 317 . . . . . 6 (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝐴 𝜑 ↔ ∀𝑥𝐴 𝜑))
92, 8imbi12d 348 . . . . 5 (∀𝑥 𝑥 = 𝑦 → ((𝑥𝐴 → ∀𝑦𝐴 𝜑) ↔ (𝑦𝐴 → ∀𝑥𝐴 𝜑)))
109dral1 2453 . . . 4 (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥𝐴 → ∀𝑦𝐴 𝜑) ↔ ∀𝑦(𝑦𝐴 → ∀𝑥𝐴 𝜑)))
11 df-ral 3114 . . . 4 (∀𝑥𝐴𝑦𝐴 𝜑 ↔ ∀𝑥(𝑥𝐴 → ∀𝑦𝐴 𝜑))
12 df-ral 3114 . . . 4 (∀𝑦𝐴𝑥𝐴 𝜑 ↔ ∀𝑦(𝑦𝐴 → ∀𝑥𝐴 𝜑))
1310, 11, 123bitr4g 317 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝐴𝑦𝐴 𝜑 ↔ ∀𝑦𝐴𝑥𝐴 𝜑))
1413biimpd 232 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝐴𝑦𝐴 𝜑 → ∀𝑦𝐴𝑥𝐴 𝜑))
15 nfnae 2448 . . . . 5 𝑦 ¬ ∀𝑥 𝑥 = 𝑦
16 nfra2 3195 . . . . 5 𝑦𝑥𝐴𝑦𝐴 𝜑
1715, 16nfan 1900 . . . 4 𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑)
18 nfnae 2448 . . . . . . . 8 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
19 nfra1 3186 . . . . . . . 8 𝑥𝑥𝐴𝑦𝐴 𝜑
2018, 19nfan 1900 . . . . . . 7 𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑)
21 nfcvf 2984 . . . . . . . . 9 (¬ ∀𝑥 𝑥 = 𝑦𝑥𝑦)
2221adantr 484 . . . . . . . 8 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) → 𝑥𝑦)
23 nfcvd 2959 . . . . . . . 8 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) → 𝑥𝐴)
2422, 23nfeld 2969 . . . . . . 7 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) → Ⅎ𝑥 𝑦𝐴)
2520, 24nfan1 2199 . . . . . 6 𝑥((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) ∧ 𝑦𝐴)
26 rsp2 3180 . . . . . . . . 9 (∀𝑥𝐴𝑦𝐴 𝜑 → ((𝑥𝐴𝑦𝐴) → 𝜑))
2726ancomsd 469 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴 𝜑 → ((𝑦𝐴𝑥𝐴) → 𝜑))
2827expdimp 456 . . . . . . 7 ((∀𝑥𝐴𝑦𝐴 𝜑𝑦𝐴) → (𝑥𝐴𝜑))
2928adantll 713 . . . . . 6 (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) ∧ 𝑦𝐴) → (𝑥𝐴𝜑))
3025, 29ralrimi 3183 . . . . 5 (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) ∧ 𝑦𝐴) → ∀𝑥𝐴 𝜑)
3130ex 416 . . . 4 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) → (𝑦𝐴 → ∀𝑥𝐴 𝜑))
3217, 31ralrimi 3183 . . 3 ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥𝐴𝑦𝐴 𝜑) → ∀𝑦𝐴𝑥𝐴 𝜑)
3332ex 416 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑥𝐴𝑦𝐴 𝜑 → ∀𝑦𝐴𝑥𝐴 𝜑))
3414, 33pm2.61i 185 1 (∀𝑥𝐴𝑦𝐴 𝜑 → ∀𝑦𝐴𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  wal 1536  wcel 2112  wnfc 2939  wral 3109
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-13 2382  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-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator