Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  oprabv Structured version   Visualization version   GIF version

Theorem oprabv 7197
 Description: If a pair and a class are in a relationship given by a class abstraction of a collection of nested ordered pairs, the involved classes are sets. (Contributed by Alexander van der Vekens, 8-Jul-2018.)
Assertion
Ref Expression
oprabv (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V))
Distinct variable groups:   𝑥,𝑋,𝑦,𝑧   𝑥,𝑌,𝑦,𝑧   𝑥,𝑍,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem oprabv
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 reloprab 7196 . . 3 Rel {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
21brrelex12i 5575 . 2 (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (⟨𝑋, 𝑌⟩ ∈ V ∧ 𝑍 ∈ V))
3 df-br 5034 . . . . 5 (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 ↔ ⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
4 opex 5324 . . . . . . . . 9 𝑋, 𝑌⟩ ∈ V
5 nfcv 2958 . . . . . . . . . . . . . 14 𝑤𝑋, 𝑌
65nfeq1 2973 . . . . . . . . . . . . 13 𝑤𝑋, 𝑌⟩ = ⟨𝑥, 𝑦
7 nfv 1915 . . . . . . . . . . . . 13 𝑤𝜑
86, 7nfan 1900 . . . . . . . . . . . 12 𝑤(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
98nfex 2335 . . . . . . . . . . 11 𝑤𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
109nfex 2335 . . . . . . . . . 10 𝑤𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
11 nfcv 2958 . . . . . . . . . . . . . 14 𝑧𝑋, 𝑌
1211nfeq1 2973 . . . . . . . . . . . . 13 𝑧𝑋, 𝑌⟩ = ⟨𝑥, 𝑦
13 nfsbc1v 3743 . . . . . . . . . . . . 13 𝑧[𝑍 / 𝑧]𝜑
1412, 13nfan 1900 . . . . . . . . . . . 12 𝑧(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)
1514nfex 2335 . . . . . . . . . . 11 𝑧𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)
1615nfex 2335 . . . . . . . . . 10 𝑧𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)
17 eqeq1 2805 . . . . . . . . . . . 12 (𝑤 = ⟨𝑋, 𝑌⟩ → (𝑤 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩))
1817anbi1d 632 . . . . . . . . . . 11 (𝑤 = ⟨𝑋, 𝑌⟩ → ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
19182exbidv 1925 . . . . . . . . . 10 (𝑤 = ⟨𝑋, 𝑌⟩ → (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
20 sbceq1a 3734 . . . . . . . . . . . 12 (𝑧 = 𝑍 → (𝜑[𝑍 / 𝑧]𝜑))
2120anbi2d 631 . . . . . . . . . . 11 (𝑧 = 𝑍 → ((⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)))
22212exbidv 1925 . . . . . . . . . 10 (𝑧 = 𝑍 → (∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)))
2310, 16, 19, 22opelopabgf 5395 . . . . . . . . 9 ((⟨𝑋, 𝑌⟩ ∈ V ∧ 𝑍 ∈ V) → (⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↔ ∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)))
244, 23mpan 689 . . . . . . . 8 (𝑍 ∈ V → (⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↔ ∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑)))
25 eqcom 2808 . . . . . . . . . . . . . . 15 (⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑌⟩)
26 vex 3447 . . . . . . . . . . . . . . . 16 𝑥 ∈ V
27 vex 3447 . . . . . . . . . . . . . . . 16 𝑦 ∈ V
2826, 27opth 5336 . . . . . . . . . . . . . . 15 (⟨𝑥, 𝑦⟩ = ⟨𝑋, 𝑌⟩ ↔ (𝑥 = 𝑋𝑦 = 𝑌))
2925, 28bitri 278 . . . . . . . . . . . . . 14 (⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝑋𝑦 = 𝑌))
30 eqvisset 3461 . . . . . . . . . . . . . . 15 (𝑥 = 𝑋𝑋 ∈ V)
31 eqvisset 3461 . . . . . . . . . . . . . . 15 (𝑦 = 𝑌𝑌 ∈ V)
3230, 31anim12i 615 . . . . . . . . . . . . . 14 ((𝑥 = 𝑋𝑦 = 𝑌) → (𝑋 ∈ V ∧ 𝑌 ∈ V))
3329, 32sylbi 220 . . . . . . . . . . . . 13 (⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ → (𝑋 ∈ V ∧ 𝑌 ∈ V))
3433adantr 484 . . . . . . . . . . . 12 ((⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑) → (𝑋 ∈ V ∧ 𝑌 ∈ V))
3534exlimivv 1933 . . . . . . . . . . 11 (∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑) → (𝑋 ∈ V ∧ 𝑌 ∈ V))
3635anim1i 617 . . . . . . . . . 10 ((∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑) ∧ 𝑍 ∈ V) → ((𝑋 ∈ V ∧ 𝑌 ∈ V) ∧ 𝑍 ∈ V))
37 df-3an 1086 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V) ↔ ((𝑋 ∈ V ∧ 𝑌 ∈ V) ∧ 𝑍 ∈ V))
3836, 37sylibr 237 . . . . . . . . 9 ((∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑) ∧ 𝑍 ∈ V) → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V))
3938expcom 417 . . . . . . . 8 (𝑍 ∈ V → (∃𝑥𝑦(⟨𝑋, 𝑌⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑍 / 𝑧]𝜑) → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
4024, 39sylbid 243 . . . . . . 7 (𝑍 ∈ V → (⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
4140com12 32 . . . . . 6 (⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} → (𝑍 ∈ V → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
42 dfoprab2 7195 . . . . . 6 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4341, 42eleq2s 2911 . . . . 5 (⟨⟨𝑋, 𝑌⟩, 𝑍⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} → (𝑍 ∈ V → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
443, 43sylbi 220 . . . 4 (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (𝑍 ∈ V → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
4544com12 32 . . 3 (𝑍 ∈ V → (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
4645adantl 485 . 2 ((⟨𝑋, 𝑌⟩ ∈ V ∧ 𝑍 ∈ V) → (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V)))
472, 46mpcom 38 1 (⟨𝑋, 𝑌⟩{⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}𝑍 → (𝑋 ∈ V ∧ 𝑌 ∈ V ∧ 𝑍 ∈ V))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538  ∃wex 1781   ∈ wcel 2112  Vcvv 3444  [wsbc 3723  ⟨cop 4534   class class class wbr 5033  {copab 5095  {coprab 7140 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-ral 3114  df-rex 3115  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-br 5034  df-opab 5096  df-xp 5529  df-rel 5530  df-oprab 7143 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator