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

Theorem cnvoprab 6037
Description: The converse of a class abstraction of nested ordered pairs. (Contributed by Thierry Arnoux, 17-Aug-2017.)
Hypotheses
Ref Expression
cnvoprab.x 𝑥𝜓
cnvoprab.y 𝑦𝜓
cnvoprab.1 (𝑎 = ⟨𝑥, 𝑦⟩ → (𝜓𝜑))
cnvoprab.2 (𝜓𝑎 ∈ (V × V))
Assertion
Ref Expression
cnvoprab {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑎,𝑦,𝑧   𝜑,𝑎
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧,𝑎)

Proof of Theorem cnvoprab
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 excom 1606 . . . . . 6 (∃𝑎𝑧(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) ↔ ∃𝑧𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
2 nfv 1473 . . . . . . . . . . 11 𝑥 𝑤 = ⟨𝑎, 𝑧
3 cnvoprab.x . . . . . . . . . . 11 𝑥𝜓
42, 3nfan 1509 . . . . . . . . . 10 𝑥(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)
54nfex 1580 . . . . . . . . 9 𝑥𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)
6 nfv 1473 . . . . . . . . . . . 12 𝑦 𝑤 = ⟨𝑎, 𝑧
7 cnvoprab.y . . . . . . . . . . . 12 𝑦𝜓
86, 7nfan 1509 . . . . . . . . . . 11 𝑦(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)
98nfex 1580 . . . . . . . . . 10 𝑦𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)
10 vex 2636 . . . . . . . . . . . 12 𝑥 ∈ V
11 vex 2636 . . . . . . . . . . . 12 𝑦 ∈ V
1210, 11opex 4080 . . . . . . . . . . 11 𝑥, 𝑦⟩ ∈ V
13 opeq1 3644 . . . . . . . . . . . . 13 (𝑎 = ⟨𝑥, 𝑦⟩ → ⟨𝑎, 𝑧⟩ = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
1413eqeq2d 2106 . . . . . . . . . . . 12 (𝑎 = ⟨𝑥, 𝑦⟩ → (𝑤 = ⟨𝑎, 𝑧⟩ ↔ 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩))
15 cnvoprab.1 . . . . . . . . . . . 12 (𝑎 = ⟨𝑥, 𝑦⟩ → (𝜓𝜑))
1614, 15anbi12d 458 . . . . . . . . . . 11 (𝑎 = ⟨𝑥, 𝑦⟩ → ((𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) ↔ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
1712, 16spcev 2727 . . . . . . . . . 10 ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → ∃𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
189, 17exlimi 1537 . . . . . . . . 9 (∃𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → ∃𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
195, 18exlimi 1537 . . . . . . . 8 (∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) → ∃𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
20 cnvoprab.2 . . . . . . . . . . 11 (𝜓𝑎 ∈ (V × V))
2120adantl 272 . . . . . . . . . 10 ((𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) → 𝑎 ∈ (V × V))
22 vex 2636 . . . . . . . . . . . 12 𝑎 ∈ V
23 1stexg 5976 . . . . . . . . . . . 12 (𝑎 ∈ V → (1st𝑎) ∈ V)
2422, 23ax-mp 7 . . . . . . . . . . 11 (1st𝑎) ∈ V
25 2ndexg 5977 . . . . . . . . . . . 12 (𝑎 ∈ V → (2nd𝑎) ∈ V)
2622, 25ax-mp 7 . . . . . . . . . . 11 (2nd𝑎) ∈ V
27 eqcom 2097 . . . . . . . . . . . . . . 15 ((1st𝑎) = 𝑥𝑥 = (1st𝑎))
28 eqcom 2097 . . . . . . . . . . . . . . 15 ((2nd𝑎) = 𝑦𝑦 = (2nd𝑎))
2927, 28anbi12i 449 . . . . . . . . . . . . . 14 (((1st𝑎) = 𝑥 ∧ (2nd𝑎) = 𝑦) ↔ (𝑥 = (1st𝑎) ∧ 𝑦 = (2nd𝑎)))
30 eqopi 5980 . . . . . . . . . . . . . 14 ((𝑎 ∈ (V × V) ∧ ((1st𝑎) = 𝑥 ∧ (2nd𝑎) = 𝑦)) → 𝑎 = ⟨𝑥, 𝑦⟩)
3129, 30sylan2br 283 . . . . . . . . . . . . 13 ((𝑎 ∈ (V × V) ∧ (𝑥 = (1st𝑎) ∧ 𝑦 = (2nd𝑎))) → 𝑎 = ⟨𝑥, 𝑦⟩)
3216bicomd 140 . . . . . . . . . . . . 13 (𝑎 = ⟨𝑥, 𝑦⟩ → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)))
3331, 32syl 14 . . . . . . . . . . . 12 ((𝑎 ∈ (V × V) ∧ (𝑥 = (1st𝑎) ∧ 𝑦 = (2nd𝑎))) → ((𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)))
344, 8, 33spc2ed 6036 . . . . . . . . . . 11 ((𝑎 ∈ (V × V) ∧ ((1st𝑎) ∈ V ∧ (2nd𝑎) ∈ V)) → ((𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) → ∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
3524, 26, 34mpanr12 431 . . . . . . . . . 10 (𝑎 ∈ (V × V) → ((𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) → ∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)))
3621, 35mpcom 36 . . . . . . . . 9 ((𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) → ∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3736exlimiv 1541 . . . . . . . 8 (∃𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓) → ∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
3819, 37impbii 125 . . . . . . 7 (∃𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
3938exbii 1548 . . . . . 6 (∃𝑧𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑧𝑎(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
40 exrot3 1632 . . . . . 6 (∃𝑧𝑥𝑦(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑))
411, 39, 403bitr2ri 208 . . . . 5 (∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑) ↔ ∃𝑎𝑧(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓))
4241abbii 2210 . . . 4 {𝑤 ∣ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)} = {𝑤 ∣ ∃𝑎𝑧(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)}
43 df-oprab 5694 . . . 4 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑥𝑦𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∧ 𝜑)}
44 df-opab 3922 . . . 4 {⟨𝑎, 𝑧⟩ ∣ 𝜓} = {𝑤 ∣ ∃𝑎𝑧(𝑤 = ⟨𝑎, 𝑧⟩ ∧ 𝜓)}
4542, 43, 443eqtr4ri 2126 . . 3 {⟨𝑎, 𝑧⟩ ∣ 𝜓} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
4645cnveqi 4642 . 2 {⟨𝑎, 𝑧⟩ ∣ 𝜓} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
47 cnvopab 4866 . 2 {⟨𝑎, 𝑧⟩ ∣ 𝜓} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
4846, 47eqtr3i 2117 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1296  wnf 1401  wex 1433  wcel 1445  {cab 2081  Vcvv 2633  cop 3469  {copab 3920   × cxp 4465  ccnv 4466  cfv 5049  {coprab 5691  1st c1st 5947  2nd c2nd 5948
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-13 1456  ax-14 1457  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480  ax-ext 2077  ax-sep 3978  ax-pow 4030  ax-pr 4060  ax-un 4284
This theorem depends on definitions:  df-bi 116  df-3an 929  df-tru 1299  df-nf 1402  df-sb 1700  df-eu 1958  df-mo 1959  df-clab 2082  df-cleq 2088  df-clel 2091  df-nfc 2224  df-ral 2375  df-rex 2376  df-v 2635  df-sbc 2855  df-un 3017  df-in 3019  df-ss 3026  df-pw 3451  df-sn 3472  df-pr 3473  df-op 3475  df-uni 3676  df-br 3868  df-opab 3922  df-mpt 3923  df-id 4144  df-xp 4473  df-rel 4474  df-cnv 4475  df-co 4476  df-dm 4477  df-rn 4478  df-iota 5014  df-fun 5051  df-fn 5052  df-f 5053  df-fo 5055  df-fv 5057  df-oprab 5694  df-1st 5949  df-2nd 5950
This theorem is referenced by:  f1od2  6038
  Copyright terms: Public domain W3C validator