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

Theorem 3optocl 5748
Description: Implicit substitution of classes for ordered pairs. (Contributed by NM, 12-Mar-1995.)
Hypotheses
Ref Expression
3optocl.1 𝑅 = (𝐷 × 𝐹)
3optocl.2 (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
3optocl.3 (⟨𝑧, 𝑤⟩ = 𝐵 → (𝜓 ↔ 𝜒))
3optocl.4 (⟨𝑣, 𝑢⟩ = 𝐶 → (𝜒 ↔ 𝜃))
3optocl.5 (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐹) ∧ (𝑧 ∈ 𝐷 ∧ 𝑤 ∈ 𝐹) ∧ (𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹)) → 𝜑)
Assertion
Ref Expression
3optocl ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅 ∧ 𝐶 ∈ 𝑅) → 𝜃)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑧,𝐵,𝑤,𝑣,𝑢   𝑣,𝐶,𝑢   𝑥,𝐷,𝑦,𝑧,𝑤,𝑣,𝑢   𝑥,𝐹,𝑦,𝑧,𝑤,𝑣,𝑢   𝑧,𝑅,𝑤,𝑣,𝑢   𝜓,𝑥,𝑦   𝜒,𝑧,𝑤   𝜃,𝑣,𝑢
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢)   𝜓(𝑧, 𝑤, 𝑣, 𝑢)   𝜒(𝑥, 𝑦, 𝑣, 𝑢)   𝜃(𝑥, 𝑦, 𝑧, 𝑤)   𝐵(𝑥, 𝑦)   𝐶(𝑥, 𝑦, 𝑧, 𝑤)   𝑅(𝑥, 𝑦)

Proof of Theorem 3optocl
StepHypRef Expression
1 3optocl.1 . . . 4 𝑅 = (𝐷 × 𝐹)
2 3optocl.4 . . . . 5 (⟨𝑣, 𝑢⟩ = 𝐶 → (𝜒 ↔ 𝜃))
32imbi2d 343 . . . 4 (⟨𝑣, 𝑢⟩ = 𝐶 → (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) → 𝜒) ↔ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) → 𝜃)))
4 3optocl.2 . . . . . . 7 (⟨𝑥, 𝑦⟩ = 𝐴 → (𝜑 ↔ 𝜓))
54imbi2d 343 . . . . . 6 (⟨𝑥, 𝑦⟩ = 𝐴 → (((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜑) ↔ ((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜓)))
6 3optocl.3 . . . . . . 7 (⟨𝑧, 𝑤⟩ = 𝐵 → (𝜓 ↔ 𝜒))
76imbi2d 343 . . . . . 6 (⟨𝑧, 𝑤⟩ = 𝐵 → (((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜓) ↔ ((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜒)))
8 3optocl.5 . . . . . . 7 (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐹) ∧ (𝑧 ∈ 𝐷 ∧ 𝑤 ∈ 𝐹) ∧ (𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹)) → 𝜑)
983expia 1139 . . . . . 6 (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐹) ∧ (𝑧 ∈ 𝐷 ∧ 𝑤 ∈ 𝐹)) → ((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜑))
101, 5, 7, 92optocl 5747 . . . . 5 ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) → ((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → 𝜒))
1110com12 33 . . . 4 ((𝑣 ∈ 𝐷 ∧ 𝑢 ∈ 𝐹) → ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) → 𝜒))
121, 3, 11optocl 5745 . . 3 (𝐶 ∈ 𝑅 → ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) → 𝜃))
1312impcom 413 . 2 (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅) ∧ 𝐶 ∈ 𝑅) → 𝜃)
14133impa 1127 1 ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑅 ∧ 𝐶 ∈ 𝑅) → 𝜃)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   × cxp 5649
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-opab 5168  df-xp 5657
This theorem is used by:  ecopovtrn  8834
  Copyright terms: Public domain W3C validator