| Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > aks6d1c1p1rcl | Structured version Visualization version GIF version | ||
| Description: Reverse closure of the introspective relation. (Contributed by metakunt, 25-Apr-2025.) |
| Ref | Expression |
|---|---|
| aks6d1c1p1rcl.1 | ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| aks6d1c1p1rcl.2 | ⊢ (𝜑 → 𝐸 ∼ 𝐹) |
| Ref | Expression |
|---|---|
| aks6d1c1p1rcl | ⊢ (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aks6d1c1p1rcl.2 | . 2 ⊢ (𝜑 → 𝐸 ∼ 𝐹) | |
| 2 | aks6d1c1p1rcl.1 | . . . . 5 ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} | |
| 3 | df-3an 1089 | . . . . . 6 ⊢ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦))) ↔ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))) | |
| 4 | 3 | opabbii 5166 | . . . . 5 ⊢ {〈𝑒, 𝑓〉 ∣ (𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵 ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} = {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| 5 | 2, 4 | eqtri 2760 | . . . 4 ⊢ ∼ = {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} |
| 6 | opabssxp 5717 | . . . 4 ⊢ {〈𝑒, 𝑓〉 ∣ ((𝑒 ∈ ℕ ∧ 𝑓 ∈ 𝐵) ∧ ∀𝑦 ∈ (𝐾 PrimRoots 𝑅)(𝑒 ↑ ((𝑂‘𝑓)‘𝑦)) = ((𝑂‘𝑓)‘(𝑒𝐷𝑦)))} ⊆ (ℕ × 𝐵) | |
| 7 | 5, 6 | eqsstri 3981 | . . 3 ⊢ ∼ ⊆ (ℕ × 𝐵) |
| 8 | 7 | brel 5690 | . 2 ⊢ (𝐸 ∼ 𝐹 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| 9 | 1, 8 | syl 17 | 1 ⊢ (𝜑 → (𝐸 ∈ ℕ ∧ 𝐹 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5099 {copab 5161 × cxp 5623 ‘cfv 6493 (class class class)co 7361 ℕcn 12150 PrimRoots cprimroots 42424 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-br 5100 df-opab 5162 df-xp 5631 |
| This theorem is referenced by: aks6d1c1p3 42443 aks6d1c1p4 42444 aks6d1c1p5 42445 aks6d1c1p6 42447 aks6d1c1p8 42448 aks6d1c2lem3 42459 aks6d1c2lem4 42460 |
| Copyright terms: Public domain | W3C validator |