Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  goeleq12bg Structured version   Visualization version   GIF version

Theorem goeleq12bg 33311
Description: Two "Godel-set of membership" codes for two variables are equal iff the two corresponding variables are equal. (Contributed by AV, 8-Oct-2023.)
Assertion
Ref Expression
goeleq12bg (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼𝑔𝐽) = (𝑀𝑔𝑁) ↔ (𝐼 = 𝑀𝐽 = 𝑁)))

Proof of Theorem goeleq12bg
StepHypRef Expression
1 goel 33309 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝑔𝐽) = ⟨∅, ⟨𝐼, 𝐽⟩⟩)
2 goel 33309 . . 3 ((𝑀 ∈ ω ∧ 𝑁 ∈ ω) → (𝑀𝑔𝑁) = ⟨∅, ⟨𝑀, 𝑁⟩⟩)
31, 2eqeqan12rd 2753 . 2 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼𝑔𝐽) = (𝑀𝑔𝑁) ↔ ⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩))
4 0ex 5231 . . . 4 ∅ ∈ V
5 opex 5379 . . . 4 𝐼, 𝐽⟩ ∈ V
64, 5opth 5391 . . 3 (⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩ ↔ (∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩))
7 eqid 2738 . . . . 5 ∅ = ∅
87biantrur 531 . . . 4 (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩))
9 opthg 5392 . . . . 5 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
109adantl 482 . . . 4 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
118, 10bitr3id 285 . . 3 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩) ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
126, 11syl5bb 283 . 2 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
133, 12bitrd 278 1 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼𝑔𝐽) = (𝑀𝑔𝑁) ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  c0 4256  cop 4567  (class class class)co 7275  ωcom 7712  𝑔cgoe 33295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-goel 33302
This theorem is referenced by:  satfv0  33320  satfv0fun  33333
  Copyright terms: Public domain W3C validator