Users' Mathboxes Mathbox for metakunt < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  aks6d1c1p1rcl Structured version   Visualization version   GIF version

Theorem aks6d1c1p1rcl 42821
Description: Reverse closure of the introspective relation. (Contributed by metakunt, 25-Apr-2025.)
Hypotheses
Ref Expression
aks6d1c1p1rcl.1 = {⟨𝑒, 𝑓⟩ ∣ (𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
aks6d1c1p1rcl.2 (𝜑𝐸 𝐹)
Assertion
Ref Expression
aks6d1c1p1rcl (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹𝐵))
Distinct variable group:   𝐵,𝑒,𝑓
Allowed substitution hints:   𝜑(𝑦,𝑒,𝑓)   𝐵(𝑦)   𝐷(𝑦,𝑒,𝑓)   (𝑦,𝑒,𝑓)   𝑅(𝑦,𝑒,𝑓)   𝐸(𝑦,𝑒,𝑓)   (𝑦,𝑒,𝑓)   𝐹(𝑦,𝑒,𝑓)   𝐾(𝑦,𝑒,𝑓)   𝑂(𝑦,𝑒,𝑓)

Proof of Theorem aks6d1c1p1rcl
StepHypRef Expression
1 aks6d1c1p1rcl.2 . 2 (𝜑𝐸 𝐹)
2 aks6d1c1p1rcl.1 . . . . 5 = {⟨𝑒, 𝑓⟩ ∣ (𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
3 df-3an 1103 . . . . . 6 ((𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦))) ↔ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦))))
43opabbii 5177 . . . . 5 {⟨𝑒, 𝑓⟩ ∣ (𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))} = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
52, 4eqtri 2784 . . . 4 = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
6 opabssxp 5753 . . . 4 {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))} ⊆ (ℕ × 𝐵)
75, 6eqsstri 3982 . . 3 ⊆ (ℕ × 𝐵)
87brel 5726 . 2 (𝐸 𝐹 → (𝐸 ∈ ℕ ∧ 𝐹𝐵))
91, 8syl 18 1 (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1568  wcel 2141  wral 3077   class class class wbr 5108  {copab 5172   × cxp 5659  cfv 6536  (class class class)co 7410  cn 12232   PrimRoots cprimroots 42804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5256  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5667
This theorem is referenced by:  aks6d1c1p3  42823  aks6d1c1p4  42824  aks6d1c1p5  42825  aks6d1c1p6  42827  aks6d1c1p8  42828  aks6d1c2lem3  42839  aks6d1c2lem4  42840
  Copyright terms: Public domain W3C validator