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 43349
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 5175 . . . . 5 {⟨𝑒, 𝑓⟩ ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))}
52, 4eqtri 2786 . . . 4 ∼ = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))}
6 opabssxp 5748 . . . 4 {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} ⊆ (ℕ × 𝐵)
75, 6eqsstri 3959 . . 3 ∼ ⊆ (ℕ × 𝐵)
87brel 5720 . 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 2147  ∀wral 3080   class class class wbr 5106  {copab 5170   × cxp 5653  ‘cfv 6555  (class class class)co 7440  ℕcn 12359   PrimRoots cprimroots 43332
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661
This theorem is used by:  aks6d1c1p3  43351  aks6d1c1p4  43352  aks6d1c1p5  43353  aks6d1c1p6  43355  aks6d1c1p8  43356  aks6d1c2lem3  43367  aks6d1c2lem4  43368
  Copyright terms: Public domain W3C validator