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

Theorem eloprabi 5822
 Description: A consequence of membership in an operation class abstraction, using ordered pair extractors. (Contributed by NM, 6-Nov-2006.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
eloprabi.1 (𝑥 = (1st ‘(1st𝐴)) → (𝜑𝜓))
eloprabi.2 (𝑦 = (2nd ‘(1st𝐴)) → (𝜓𝜒))
eloprabi.3 (𝑧 = (2nd𝐴) → (𝜒𝜃))
Assertion
Ref Expression
eloprabi (𝐴 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → 𝜃)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝜃,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧)   𝜒(𝑥,𝑦,𝑧)

Proof of Theorem eloprabi
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2046 . . . . . 6 (𝑤 = 𝐴 → (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ↔ 𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩))
21anbi1d 438 . . . . 5 (𝑤 = 𝐴 → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
323exbidv 1749 . . . 4 (𝑤 = 𝐴 → (∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑦𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
4 df-oprab 5516 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
53, 4elab2g 2689 . . 3 (𝐴 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → (𝐴 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ ∃𝑥𝑦𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
65ibi 165 . 2 (𝐴 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → ∃𝑥𝑦𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
7 vex 2560 . . . . . . . . . . . 12 𝑥 ∈ V
8 vex 2560 . . . . . . . . . . . 12 𝑦 ∈ V
97, 8opex 3966 . . . . . . . . . . 11 𝑥, 𝑦⟩ ∈ V
10 vex 2560 . . . . . . . . . . 11 𝑧 ∈ V
119, 10op1std 5775 . . . . . . . . . 10 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (1st𝐴) = ⟨𝑥, 𝑦⟩)
1211fveq2d 5182 . . . . . . . . 9 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (1st ‘(1st𝐴)) = (1st ‘⟨𝑥, 𝑦⟩))
137, 8op1st 5773 . . . . . . . . 9 (1st ‘⟨𝑥, 𝑦⟩) = 𝑥
1412, 13syl6req 2089 . . . . . . . 8 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑥 = (1st ‘(1st𝐴)))
15 eloprabi.1 . . . . . . . 8 (𝑥 = (1st ‘(1st𝐴)) → (𝜑𝜓))
1614, 15syl 14 . . . . . . 7 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝜑𝜓))
1711fveq2d 5182 . . . . . . . . 9 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (2nd ‘(1st𝐴)) = (2nd ‘⟨𝑥, 𝑦⟩))
187, 8op2nd 5774 . . . . . . . . 9 (2nd ‘⟨𝑥, 𝑦⟩) = 𝑦
1917, 18syl6req 2089 . . . . . . . 8 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑦 = (2nd ‘(1st𝐴)))
20 eloprabi.2 . . . . . . . 8 (𝑦 = (2nd ‘(1st𝐴)) → (𝜓𝜒))
2119, 20syl 14 . . . . . . 7 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝜓𝜒))
229, 10op2ndd 5776 . . . . . . . . 9 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (2nd𝐴) = 𝑧)
2322eqcomd 2045 . . . . . . . 8 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑧 = (2nd𝐴))
24 eloprabi.3 . . . . . . . 8 (𝑧 = (2nd𝐴) → (𝜒𝜃))
2523, 24syl 14 . . . . . . 7 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝜒𝜃))
2616, 21, 253bitrd 203 . . . . . 6 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝜑𝜃))
2726biimpa 280 . . . . 5 ((𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → 𝜃)
2827exlimiv 1489 . . . 4 (∃𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → 𝜃)
2928exlimiv 1489 . . 3 (∃𝑦𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → 𝜃)
3029exlimiv 1489 . 2 (∃𝑥𝑦𝑧(𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → 𝜃)
316, 30syl 14 1 (𝐴 ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → 𝜃)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243  ∃wex 1381   ∈ wcel 1393  ⟨cop 3378  ‘cfv 4902  {coprab 5513  1st c1st 5765  2nd c2nd 5766 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-iota 4867  df-fun 4904  df-fv 4910  df-oprab 5516  df-1st 5767  df-2nd 5768 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator