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

Theorem brfldext 34347
Description: The field extension relation explicited. (Contributed by Thierry Arnoux, 29-Jul-2023.)
Assertion
Ref Expression
brfldext ((𝐸 ∈ Field ∧ 𝐹 ∈ Field) → (𝐸/FldExt𝐹 ↔ (𝐹 = (𝐸 ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘𝐸))))

Proof of Theorem brfldext
Dummy variables 𝑒 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . . . 6 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → 𝑒 = 𝐸)
21eleq1d 2849 . . . . 5 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑒 ∈ Field ↔ 𝐸 ∈ Field))
3 simpr 490 . . . . . 6 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
43eleq1d 2849 . . . . 5 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑓 ∈ Field ↔ 𝐹 ∈ Field))
52, 4anbi12d 644 . . . 4 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → ((𝑒 ∈ Field ∧ 𝑓 ∈ Field) ↔ (𝐸 ∈ Field ∧ 𝐹 ∈ Field)))
63fveq2d 6912 . . . . . . 7 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (Base‘𝑓) = (Base‘𝐹))
71, 6oveq12d 7461 . . . . . 6 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑒 ↾s (Base‘𝑓)) = (𝐸 ↾s (Base‘𝐹)))
83, 7eqeq12d 2779 . . . . 5 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (𝑓 = (𝑒 ↾s (Base‘𝑓)) ↔ 𝐹 = (𝐸 ↾s (Base‘𝐹))))
91fveq2d 6912 . . . . . 6 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (SubRing‘𝑒) = (SubRing‘𝐸))
106, 9eleq12d 2858 . . . . 5 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → ((Base‘𝑓) ∈ (SubRing‘𝑒) ↔ (Base‘𝐹) ∈ (SubRing‘𝐸)))
118, 10anbi12d 644 . . . 4 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → ((𝑓 = (𝑒 ↾s (Base‘𝑓)) ∧ (Base‘𝑓) ∈ (SubRing‘𝑒)) ↔ (𝐹 = (𝐸 ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘𝐸))))
125, 11anbi12d 644 . . 3 ((𝑒 = 𝐸 ∧ 𝑓 = 𝐹) → (((𝑒 ∈ Field ∧ 𝑓 ∈ Field) ∧ (𝑓 = (𝑒 ↾s (Base‘𝑓)) ∧ (Base‘𝑓) ∈ (SubRing‘𝑒))) ↔ ((𝐸 ∈ Field ∧ 𝐹 ∈ Field) ∧ (𝐹 = (𝐸 ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘𝐸)))))
13 df-fldext 34343 . . 3 /FldExt = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ Field ∧ 𝑓 ∈ Field) ∧ (𝑓 = (𝑒 ↾s (Base‘𝑓)) ∧ (Base‘𝑓) ∈ (SubRing‘𝑒)))}
1412, 13brabga 5512 . 2 ((𝐸 ∈ Field ∧ 𝐹 ∈ Field) → (𝐸/FldExt𝐹 ↔ ((𝐸 ∈ Field ∧ 𝐹 ∈ Field) ∧ (𝐹 = (𝐸 ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘𝐸)))))
1514bianabs 551 1 ((𝐸 ∈ Field ∧ 𝐹 ∈ Field) → (𝐸/FldExt𝐹 ↔ (𝐹 = (𝐸 ↾s (Base‘𝐹)) ∧ (Base‘𝐹) ∈ (SubRing‘𝐸))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  Basecbs 17416   ↾s cress 17437  SubRingcsubrg 20851  Fieldcfield 21011  /FldExtcfldext 34340
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-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-iota 6512  df-fv 6566  df-ov 7446  df-fldext 34343
This theorem is used by:  ccfldextrr  34348  fldextsubrg  34351  sdrgfldext  34352  fldextress  34353  fldexttr  34360  fldextid  34361  fldsdrgfldext  34363  extdgmul  34365  fldgenfldext  34370  fldextrspunlem1  34377  algextdeglem4  34422
  Copyright terms: Public domain W3C validator