Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  relexp0eq Structured version   Visualization version   GIF version

Theorem relexp0eq 44891
Description: The zeroth power of relationships is the same if and only if the union of their domain and ranges is the same. (Contributed by RP, 11-Jun-2020.)
Assertion
Ref Expression
relexp0eq ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ (𝐴↑𝑟0) = (𝐵↑𝑟0)))

Proof of Theorem relexp0eq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfcleq 2756 . . . 4 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
2 alcom 2199 . . . . 5 (∀𝑦∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
3 19.3v 2017 . . . . 5 (∀𝑦∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
4 ax6ev 2004 . . . . . . . . 9 ∃𝑦 𝑦 = 𝑥
5 pm5.5 364 . . . . . . . . 9 (∃𝑦 𝑦 = 𝑥 → ((∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
64, 5ax-mp 5 . . . . . . . 8 ((∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
7 19.23v 1977 . . . . . . . 8 (∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ (∃𝑦 𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
8 19.3v 2017 . . . . . . . 8 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)))
96, 7, 83bitr4ri 307 . . . . . . 7 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
10 pm5.32 584 . . . . . . . . 9 ((𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))))
11 ancom 466 . . . . . . . . . 10 ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥))
12 ancom 466 . . . . . . . . . 10 ((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥))
1311, 12bibi12i 342 . . . . . . . . 9 (((𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐴 ∪ ran 𝐴)) ↔ (𝑦 = 𝑥 ∧ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1410, 13bitri 278 . . . . . . . 8 ((𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1514albii 1852 . . . . . . 7 (∀𝑦(𝑦 = 𝑥 → (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵))) ↔ ∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
169, 15bitri 278 . . . . . 6 (∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
1716albii 1852 . . . . 5 (∀𝑥∀𝑦(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
182, 3, 173bitr3i 304 . . . 4 (∀𝑥(𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ↔ 𝑥 ∈ (dom 𝐵 ∪ ran 𝐵)) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
191, 18bitri 278 . . 3 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
20 eqopab2bw 5527 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} ↔ ∀𝑥∀𝑦((𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥) ↔ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)))
21 opabresid 6053 . . . . 5 ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)}
2221eqcomi 2772 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = ( I ↾ (dom 𝐴 ∪ ran 𝐴))
23 opabresid 6053 . . . . 5 ( I ↾ (dom 𝐵 ∪ ran 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)}
2423eqcomi 2772 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} = ( I ↾ (dom 𝐵 ∪ ran 𝐵))
2522, 24eqeq12i 2781 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐴 ∪ ran 𝐴) ∧ 𝑦 = 𝑥)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (dom 𝐵 ∪ ran 𝐵) ∧ 𝑦 = 𝑥)} ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
2619, 20, 253bitr2i 302 . 2 ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
27 relexp0g 15201 . . 3 (𝐴 ∈ 𝑈 → (𝐴↑𝑟0) = ( I ↾ (dom 𝐴 ∪ ran 𝐴)))
28 relexp0g 15201 . . 3 (𝐵 ∈ 𝑉 → (𝐵↑𝑟0) = ( I ↾ (dom 𝐵 ∪ ran 𝐵)))
2927, 28eqeqan12d 2777 . 2 ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((𝐴↑𝑟0) = (𝐵↑𝑟0) ↔ ( I ↾ (dom 𝐴 ∪ ran 𝐴)) = ( I ↾ (dom 𝐵 ∪ ran 𝐵))))
3026, 29bitr4id 293 1 ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉) → ((dom 𝐴 ∪ ran 𝐴) = (dom 𝐵 ∪ ran 𝐵) ↔ (𝐴↑𝑟0) = (𝐵↑𝑟0)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ∪ cun 4152  {copab 5170   I cid 5549  dom cdm 5655  ran crn 5656   ↾ cres 5657  (class class class)co 7440  0cc0 11224  ↑𝑟crelexp 15198
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-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-mulcl 11286  ax-i2m1 11292
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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6509  df-fun 6557  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-n0 12631  df-relexp 15199
This theorem is used by:  iunrelexp0  44892
  Copyright terms: Public domain W3C validator