finextfldext - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > finextfldext		Structured version Visualization version GIF version

Theorem finextfldext 34352

Description: A finite field extension is a field extension. (Contributed by Thierry Arnoux, 10-Jan-2026.)

**Hypothesis**
Ref	Expression
finextfldext.1	⊢ (𝜑 → 𝐸/_FinExt𝐹)

**Assertion**
Ref	Expression
finextfldext	⊢ (𝜑 → 𝐸/_FldExt𝐹)

Proof of Theorem finextfldext Dummy variables 𝑒 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		finextfldext.1	. . 3 ⊢ (𝜑 → 𝐸/_FinExt𝐹)
2		df-finext 34331	. . . . . . 7 ⊢ /_FinExt = {⟨𝑒, 𝑓⟩ ∣ (𝑒/_FldExt𝑓 ∧ (𝑒[:]𝑓) ∈ ℕ₀)}
3	2	relopabiv 5803	. . . . . 6 ⊢ Rel /_FinExt
4	3	brrelex1i 5711	. . . . 5 ⊢ (𝐸/_FinExt𝐹 → 𝐸 ∈ V)
5	1, 4	syl 18	. . . 4 ⊢ (𝜑 → 𝐸 ∈ V)
6	3	brrelex2i 5712	. . . . 5 ⊢ (𝐸/_FinExt𝐹 → 𝐹 ∈ V)
7	1, 6	syl 18	. . . 4 ⊢ (𝜑 → 𝐹 ∈ V)
8		breq12 5111	. . . . . 6 ⊢ ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑒/_FldExt𝑓 ↔ 𝐸/_FldExt𝐹))
9		oveq12 7439	. . . . . . 7 ⊢ ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑒[:]𝑓) = (𝐸[:]𝐹))
10	9	eleq1d 2849	. . . . . 6 ⊢ ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → ((𝑒[:]𝑓) ∈ ℕ₀ ↔ (𝐸[:]𝐹) ∈ ℕ₀))
11	8, 10	anbi12d 644	. . . . 5 ⊢ ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → ((𝑒/_FldExt𝑓 ∧ (𝑒[:]𝑓) ∈ ℕ₀) ↔ (𝐸/_FldExt𝐹 ∧ (𝐸[:]𝐹) ∈ ℕ₀)))
12	11, 2	brabga 5512	. . . 4 ⊢ ((𝐸 ∈ V ∧ 𝐹 ∈ V) → (𝐸/_FinExt𝐹 ↔ (𝐸/_FldExt𝐹 ∧ (𝐸[:]𝐹) ∈ ℕ₀)))
13	5, 7, 12	syl2anc 596	. . 3 ⊢ (𝜑 → (𝐸/_FinExt𝐹 ↔ (𝐸/_FldExt𝐹 ∧ (𝐸[:]𝐹) ∈ ℕ₀)))
14	1, 13	mpbid 235	. 2 ⊢ (𝜑 → (𝐸/_FldExt𝐹 ∧ (𝐸[:]𝐹) ∈ ℕ₀))
15	14	simpld 500	1 ⊢ (𝜑 → 𝐸/_FldExt𝐹)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 Vcvv 3454 class class class wbr 5106 (class class class)co 7430 ℕ₀cn0 12619 /_FldExtcfldext 34326 /_FinExtcfinext 34327 [:]cextdg 34328

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 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 1572 df-fal 1582 df-ex 1812 df-sb 2101 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-uni 4871 df-br 5107 df-opab 5171 df-xp 5661 df-rel 5662 df-iota 6501 df-fv 6555 df-ov 7433 df-finext 34331

This theorem is used by: finextalg 34386

W3C validator