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

Theorem opelopabf 4398
Description: The law of concretion. Theorem 9.5 of [Quine] p. 61. This version of opelopab 4395 uses bound-variable hypotheses in place of distinct variable conditions. (Contributed by NM, 19-Dec-2008.)
Hypotheses
Ref Expression
opelopabf.x 𝑥𝜓
opelopabf.y 𝑦𝜒
opelopabf.1 𝐴 ∈ V
opelopabf.2 𝐵 ∈ V
opelopabf.3 (𝑥 = 𝐴 → (𝜑𝜓))
opelopabf.4 (𝑦 = 𝐵 → (𝜓𝜒))
Assertion
Ref Expression
opelopabf (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦)

Proof of Theorem opelopabf
StepHypRef Expression
1 opelopabsb 4383 . 2 (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ [𝐴 / 𝑥][𝐵 / 𝑦]𝜑)
2 opelopabf.1 . . 3 𝐴 ∈ V
3 nfcv 2386 . . . . 5 𝑥𝐵
4 opelopabf.x . . . . 5 𝑥𝜓
53, 4nfsbc 3066 . . . 4 𝑥[𝐵 / 𝑦]𝜓
6 opelopabf.3 . . . . 5 (𝑥 = 𝐴 → (𝜑𝜓))
76sbcbidv 3104 . . . 4 (𝑥 = 𝐴 → ([𝐵 / 𝑦]𝜑[𝐵 / 𝑦]𝜓))
85, 7sbciegf 3077 . . 3 (𝐴 ∈ V → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑[𝐵 / 𝑦]𝜓))
92, 8ax-mp 5 . 2 ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑[𝐵 / 𝑦]𝜓)
10 opelopabf.2 . . 3 𝐵 ∈ V
11 opelopabf.y . . . 4 𝑦𝜒
12 opelopabf.4 . . . 4 (𝑦 = 𝐵 → (𝜓𝜒))
1311, 12sbciegf 3077 . . 3 (𝐵 ∈ V → ([𝐵 / 𝑦]𝜓𝜒))
1410, 13ax-mp 5 . 2 ([𝐵 / 𝑦]𝜓𝜒)
151, 9, 143bitri 206 1 (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜒)
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1398  wnf 1509  wcel 2205  Vcvv 2815  [wsbc 3045  cop 3697  {copab 4175
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-opab 4177
This theorem is referenced by:  pofun  4438  fmptco  5848  uchoice  6344
  Copyright terms: Public domain W3C validator