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

Theorem opelopabsbALT 4257
Description: The law of concretion in terms of substitutions. Less general than opelopabsb 4258, but having a much shorter proof. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
opelopabsbALT (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑤 / 𝑦][𝑧 / 𝑥]𝜑)
Distinct variable groups:   𝑥,𝑦,𝑧   𝑥,𝑤,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem opelopabsbALT
StepHypRef Expression
1 excom 1664 . . 3 (∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦𝑥(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2 vex 2740 . . . . . . 7 𝑧 ∈ V
3 vex 2740 . . . . . . 7 𝑤 ∈ V
42, 3opth 4235 . . . . . 6 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑧 = 𝑥𝑤 = 𝑦))
5 equcom 1706 . . . . . . 7 (𝑧 = 𝑥𝑥 = 𝑧)
6 equcom 1706 . . . . . . 7 (𝑤 = 𝑦𝑦 = 𝑤)
75, 6anbi12ci 461 . . . . . 6 ((𝑧 = 𝑥𝑤 = 𝑦) ↔ (𝑦 = 𝑤𝑥 = 𝑧))
84, 7bitri 184 . . . . 5 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑦 = 𝑤𝑥 = 𝑧))
98anbi1i 458 . . . 4 ((⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ((𝑦 = 𝑤𝑥 = 𝑧) ∧ 𝜑))
1092exbii 1606 . . 3 (∃𝑦𝑥(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦𝑥((𝑦 = 𝑤𝑥 = 𝑧) ∧ 𝜑))
111, 10bitri 184 . 2 (∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦𝑥((𝑦 = 𝑤𝑥 = 𝑧) ∧ 𝜑))
12 elopab 4256 . 2 (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
13 2sb5 1983 . 2 ([𝑤 / 𝑦][𝑧 / 𝑥]𝜑 ↔ ∃𝑦𝑥((𝑦 = 𝑤𝑥 = 𝑧) ∧ 𝜑))
1411, 12, 133bitr4i 212 1 (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝑤 / 𝑦][𝑧 / 𝑥]𝜑)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1353  wex 1492  [wsb 1762  wcel 2148  cop 3595  {copab 4061
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 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4119  ax-pow 4172  ax-pr 4207
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-opab 4063
This theorem is referenced by:  inopab  4756  cnvopab  5027
  Copyright terms: Public domain W3C validator