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 34157
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 2847 . . . . 5 ((𝑒 = 𝐸𝑓 = 𝐹) → (𝑒 ∈ Field ↔ 𝐸 ∈ Field))
3 simpr 490 . . . . . 6 ((𝑒 = 𝐸𝑓 = 𝐹) → 𝑓 = 𝐹)
43eleq1d 2847 . . . . 5 ((𝑒 = 𝐸𝑓 = 𝐹) → (𝑓 ∈ Field ↔ 𝐹 ∈ Field))
52, 4anbi12d 644 . . . 4 ((𝑒 = 𝐸𝑓 = 𝐹) → ((𝑒 ∈ Field ∧ 𝑓 ∈ Field) ↔ (𝐸 ∈ Field ∧ 𝐹 ∈ Field)))
63fveq2d 6886 . . . . . . 7 ((𝑒 = 𝐸𝑓 = 𝐹) → (Base‘𝑓) = (Base‘𝐹))
71, 6oveq12d 7434 . . . . . 6 ((𝑒 = 𝐸𝑓 = 𝐹) → (𝑒s (Base‘𝑓)) = (𝐸s (Base‘𝐹)))
83, 7eqeq12d 2778 . . . . 5 ((𝑒 = 𝐸𝑓 = 𝐹) → (𝑓 = (𝑒s (Base‘𝑓)) ↔ 𝐹 = (𝐸s (Base‘𝐹))))
91fveq2d 6886 . . . . . 6 ((𝑒 = 𝐸𝑓 = 𝐹) → (SubRing‘𝑒) = (SubRing‘𝐸))
106, 9eleq12d 2856 . . . . 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 34153 . . 3 /FldExt = {⟨𝑒, 𝑓⟩ ∣ ((𝑒 ∈ Field ∧ 𝑓 ∈ Field) ∧ (𝑓 = (𝑒s (Base‘𝑓)) ∧ (Base‘𝑓) ∈ (SubRing‘𝑒)))}
1412, 13brabga 5516 . 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 2145   class class class wbr 5107  cfv 6537  (class class class)co 7416  Basecbs 17305  s cress 17326  SubRingcsubrg 20735  Fieldcfield 20895  /FldExtcfldext 34150
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-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-uni 4871  df-br 5108  df-opab 5172  df-iota 6493  df-fv 6545  df-ov 7419  df-fldext 34153
This theorem is used by:  ccfldextrr  34158  fldextsubrg  34161  sdrgfldext  34162  fldextress  34163  fldexttr  34170  fldextid  34171  fldsdrgfldext  34173  extdgmul  34175  fldgenfldext  34180  fldextrspunlem1  34187  algextdeglem4  34232
  Copyright terms: Public domain W3C validator