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 42961
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 1105 . . . . . 6 ((𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦))) ↔ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦))))
43opabbii 5176 . . . . 5 {⟨𝑒, 𝑓⟩ ∣ (𝑒 ∈ ℕ ∧ 𝑓𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))} = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
52, 4eqtri 2785 . . . 4 = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))}
6 opabssxp 5751 . . . 4 {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ((𝑂𝑓)‘𝑦)) = ((𝑂𝑓)‘(𝑒𝐷𝑦)))} ⊆ (ℕ × 𝐵)
75, 6eqsstri 3980 . . 3 ⊆ (ℕ × 𝐵)
87brel 5724 . 2 (𝐸 𝐹 → (𝐸 ∈ ℕ ∧ 𝐹𝐵))
91, 8syl 18 1 (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078   class class class wbr 5107  {copab 5171   × cxp 5657  cfv 6537  (class class class)co 7416  cn 12260   PrimRoots cprimroots 42944
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 2734  ax-sep 5255  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665
This theorem is used by:  aks6d1c1p3  42963  aks6d1c1p4  42964  aks6d1c1p5  42965  aks6d1c1p6  42967  aks6d1c1p8  42968  aks6d1c2lem3  42979  aks6d1c2lem4  42980
  Copyright terms: Public domain W3C validator