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 35590
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 35588 . . 3 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (𝐼𝑔𝐽) = ⟨∅, ⟨𝐼, 𝐽⟩⟩)
2 goel 35588 . . 3 ((𝑀 ∈ ω ∧ 𝑁 ∈ ω) → (𝑀𝑔𝑁) = ⟨∅, ⟨𝑀, 𝑁⟩⟩)
31, 2eqeqan12rd 2756 . 2 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼𝑔𝐽) = (𝑀𝑔𝑁) ↔ ⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩))
4 0ex 5231 . . . 4 ∅ ∈ V
5 opex 5405 . . . 4 𝐼, 𝐽⟩ ∈ V
64, 5opth 5418 . . 3 (⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩ ↔ (∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩))
7 eqid 2741 . . . . 5 ∅ = ∅
87biantrur 536 . . . 4 (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩))
9 opthg 5419 . . . . 5 ((𝐼 ∈ ω ∧ 𝐽 ∈ ω) → (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
109adantl 483 . . . 4 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
118, 10bitr3id 287 . . 3 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((∅ = ∅ ∧ ⟨𝐼, 𝐽⟩ = ⟨𝑀, 𝑁⟩) ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
126, 11bitrid 285 . 2 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → (⟨∅, ⟨𝐼, 𝐽⟩⟩ = ⟨∅, ⟨𝑀, 𝑁⟩⟩ ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
133, 12bitrd 281 1 (((𝑀 ∈ ω ∧ 𝑁 ∈ ω) ∧ (𝐼 ∈ ω ∧ 𝐽 ∈ ω)) → ((𝐼𝑔𝐽) = (𝑀𝑔𝑁) ↔ (𝐼 = 𝑀𝐽 = 𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  c0 4263  cop 4563  (class class class)co 7359  ωcom 7809  𝑔cgoe 35574
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5220  ax-nul 5230  ax-pr 5364
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-iota 6444  df-fun 6490  df-fv 6496  df-ov 7362  df-goel 35581
This theorem is referenced by:  satfv0  35599  satfv0fun  35612
  Copyright terms: Public domain W3C validator