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

Theorem ralxfrALT 4461
Description: Transfer universal quantification from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. This proof does not use ralxfrd 4456. (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 2835 . . . . 5 (𝐴𝐵 → (∀𝑥𝐵 𝜑𝜓))
41, 3syl 14 . . . 4 (𝑦𝐶 → (∀𝑥𝐵 𝜑𝜓))
54com12 30 . . 3 (∀𝑥𝐵 𝜑 → (𝑦𝐶𝜓))
65ralrimiv 2547 . 2 (∀𝑥𝐵 𝜑 → ∀𝑦𝐶 𝜓)
7 ralxfr.2 . . . 4 (𝑥𝐵 → ∃𝑦𝐶 𝑥 = 𝐴)
8 nfra1 2506 . . . . 5 𝑦𝑦𝐶 𝜓
9 nfv 1526 . . . . 5 𝑦𝜑
10 rsp 2522 . . . . . 6 (∀𝑦𝐶 𝜓 → (𝑦𝐶𝜓))
112biimprcd 160 . . . . . 6 (𝜓 → (𝑥 = 𝐴𝜑))
1210, 11syl6 33 . . . . 5 (∀𝑦𝐶 𝜓 → (𝑦𝐶 → (𝑥 = 𝐴𝜑)))
138, 9, 12rexlimd 2589 . . . 4 (∀𝑦𝐶 𝜓 → (∃𝑦𝐶 𝑥 = 𝐴𝜑))
147, 13syl5 32 . . 3 (∀𝑦𝐶 𝜓 → (𝑥𝐵𝜑))
1514ralrimiv 2547 . 2 (∀𝑦𝐶 𝜓 → ∀𝑥𝐵 𝜑)
166, 15impbii 126 1 (∀𝑥𝐵 𝜑 ↔ ∀𝑦𝐶 𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1353  wcel 2146  wral 2453  wrex 2454
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator