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

Theorem sbcopeq1a 6394
Description: Equality theorem for substitution of a class for an ordered pair (analog of sbceq1a 3055 that avoids the existential quantifiers of copsexg 4365). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
sbcopeq1a (𝐴 = ⟨𝑥, 𝑦⟩ → ([(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑𝜑))

Proof of Theorem sbcopeq1a
StepHypRef Expression
1 vex 2818 . . . . 5 𝑥 ∈ V
2 vex 2818 . . . . 5 𝑦 ∈ V
31, 2op2ndd 6356 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (2nd𝐴) = 𝑦)
43eqcomd 2240 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑦 = (2nd𝐴))
5 sbceq1a 3055 . . 3 (𝑦 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑦]𝜑))
64, 5syl 14 . 2 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑[(2nd𝐴) / 𝑦]𝜑))
71, 2op1std 6355 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (1st𝐴) = 𝑥)
87eqcomd 2240 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑥 = (1st𝐴))
9 sbceq1a 3055 . . 3 (𝑥 = (1st𝐴) → ([(2nd𝐴) / 𝑦]𝜑[(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑))
108, 9syl 14 . 2 (𝐴 = ⟨𝑥, 𝑦⟩ → ([(2nd𝐴) / 𝑦]𝜑[(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑))
116, 10bitr2d 189 1 (𝐴 = ⟨𝑥, 𝑦⟩ → ([(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑𝜑))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1398  [wsbc 3045  cop 3697  cfv 5357  1st c1st 6345  2nd c2nd 6346
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
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-ral 2527  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-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fv 5365  df-1st 6347  df-2nd 6348
This theorem is referenced by:  dfopab2  6396  dfoprab3s  6397
  Copyright terms: Public domain W3C validator