Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pridlc3 Structured version   Visualization version   GIF version

Theorem pridlc3 39273
Description: Obsolete theorem, use cmprmidlmcl 21682 instead. Property of a prime ideal in a commutative ring. (Contributed by Jeff Madsen, 17-Jun-2011.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
ispridlc.1 𝐺 = (1st ‘𝑅)
ispridlc.2 𝐻 = (2nd ‘𝑅)
ispridlc.3 𝑋 = ran 𝐺
Assertion
Ref Expression
pridlc3 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → (𝐴𝐻𝐵) ∈ (𝑋 ∖ 𝑃))

Proof of Theorem pridlc3
StepHypRef Expression
1 crngorngo 39200 . . . 4 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
2 eldifi 4070 . . . . 5 (𝐴 ∈ (𝑋 ∖ 𝑃) → 𝐴 ∈ 𝑋)
3 eldifi 4070 . . . . 5 (𝐵 ∈ (𝑋 ∖ 𝑃) → 𝐵 ∈ 𝑋)
42, 3anim12i 625 . . . 4 ((𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃)) → (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋))
5 ispridlc.1 . . . . . 6 𝐺 = (1st ‘𝑅)
6 ispridlc.2 . . . . . 6 𝐻 = (2nd ‘𝑅)
7 ispridlc.3 . . . . . 6 𝑋 = ran 𝐺
85, 6, 7rngocl 39101 . . . . 5 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐻𝐵) ∈ 𝑋)
983expb 1138 . . . 4 ((𝑅 ∈ RingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝐻𝐵) ∈ 𝑋)
101, 4, 9syl2an 608 . . 3 ((𝑅 ∈ CRingOps ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → (𝐴𝐻𝐵) ∈ 𝑋)
1110adantlr 728 . 2 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → (𝐴𝐻𝐵) ∈ 𝑋)
12 eldifn 4071 . . . 4 (𝐵 ∈ (𝑋 ∖ 𝑃) → ¬ 𝐵 ∈ 𝑃)
1312ad2antll 742 . . 3 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → ¬ 𝐵 ∈ 𝑃)
145, 6, 7pridlc2 39272 . . . . . . 7 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ 𝑋 ∧ (𝐴𝐻𝐵) ∈ 𝑃)) → 𝐵 ∈ 𝑃)
15143exp2 1373 . . . . . 6 ((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) → (𝐴 ∈ (𝑋 ∖ 𝑃) → (𝐵 ∈ 𝑋 → ((𝐴𝐻𝐵) ∈ 𝑃 → 𝐵 ∈ 𝑃))))
1615imp32 424 . . . . 5 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐻𝐵) ∈ 𝑃 → 𝐵 ∈ 𝑃))
1716con3d 153 . . . 4 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ 𝑋)) → (¬ 𝐵 ∈ 𝑃 → ¬ (𝐴𝐻𝐵) ∈ 𝑃))
183, 17sylanr2 696 . . 3 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → (¬ 𝐵 ∈ 𝑃 → ¬ (𝐴𝐻𝐵) ∈ 𝑃))
1913, 18mpd 16 . 2 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → ¬ (𝐴𝐻𝐵) ∈ 𝑃)
2011, 19eldifd 4053 1 (((𝑅 ∈ CRingOps ∧ 𝑃 ∈ (PrIdl‘𝑅)) ∧ (𝐴 ∈ (𝑋 ∖ 𝑃) ∧ 𝐵 ∈ (𝑋 ∖ 𝑃))) → (𝐴𝐻𝐵) ∈ (𝑋 ∖ 𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ∖ cdif 4048  ran crn 5659  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  RingOpscrngo 39094  CRingOpsccring 39193  PrIdlcpridl 39208
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-grpo 31152  df-gid 31153  df-ginv 31154  df-ablo 31204  df-ass 39043  df-exid 39045  df-mgmOLD 39049  df-sgrOLD 39061  df-mndo 39067  df-rngo 39095  df-com2 39190  df-crngo 39194  df-idl 39210  df-pridl 39211  df-igen 39260
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator