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

Theorem ralxfrALT 4217
Description: Transfer universal quantification from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. This proof does not use ralxfrd 4212. (Contributed by NM, 10-Jun-2005.) (Revised by Mario Carneiro, 15-Aug-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
ralxfr.1 (𝑦𝐶𝐴𝐵)
ralxfr.2 (𝑥𝐵 → ∃𝑦𝐶 𝑥 = 𝐴)
ralxfr.3 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
ralxfrALT (∀𝑥𝐵 𝜑 ↔ ∀𝑦𝐶 𝜓)
Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝑥,𝐴   𝑥,𝑦,𝐵   𝑥,𝐶
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑦)   𝐶(𝑦)

Proof of Theorem ralxfrALT
StepHypRef Expression
1 ralxfr.1 . . . . 5 (𝑦𝐶𝐴𝐵)
2 ralxfr.3 . . . . . 6 (𝑥 = 𝐴 → (𝜑𝜓))
32rspcv 2697 . . . . 5 (𝐴𝐵 → (∀𝑥𝐵 𝜑𝜓))
41, 3syl 14 . . . 4 (𝑦𝐶 → (∀𝑥𝐵 𝜑𝜓))
54com12 30 . . 3 (∀𝑥𝐵 𝜑 → (𝑦𝐶𝜓))
65ralrimiv 2433 . 2 (∀𝑥𝐵 𝜑 → ∀𝑦𝐶 𝜓)
7 ralxfr.2 . . . 4 (𝑥𝐵 → ∃𝑦𝐶 𝑥 = 𝐴)
8 nfra1 2397 . . . . 5 𝑦𝑦𝐶 𝜓
9 nfv 1461 . . . . 5 𝑦𝜑
10 rsp 2411 . . . . . 6 (∀𝑦𝐶 𝜓 → (𝑦𝐶𝜓))
112biimprcd 158 . . . . . 6 (𝜓 → (𝑥 = 𝐴𝜑))
1210, 11syl6 33 . . . . 5 (∀𝑦𝐶 𝜓 → (𝑦𝐶 → (𝑥 = 𝐴𝜑)))
138, 9, 12rexlimd 2474 . . . 4 (∀𝑦𝐶 𝜓 → (∃𝑦𝐶 𝑥 = 𝐴𝜑))
147, 13syl5 32 . . 3 (∀𝑦𝐶 𝜓 → (𝑥𝐵𝜑))
1514ralrimiv 2433 . 2 (∀𝑦𝐶 𝜓 → ∀𝑥𝐵 𝜑)
166, 15impbii 124 1 (∀𝑥𝐵 𝜑 ↔ ∀𝑦𝐶 𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 103   = wceq 1284  wcel 1433  wral 2348  wrex 2349
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 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator