Metamath Proof Explorer


Theorem kardexen

Description: One set is equinumerous to another iff an element in its kard cardinality is equinumerous to an element in the second set's kard cardinality. See kardeng for a version with equality of cardinals. (Contributed by BTernaryTau, 7-Jul-2026)

Ref Expression
Assertion kardexen ( 𝐴𝐵 ↔ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )

Proof

Step Hyp Ref Expression
1 2r19.29 ( ( ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ∧ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 ) → ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) ( ¬ 𝑥𝑦𝑥𝑦 ) )
2 bren2 ( 𝐴𝐵 ↔ ( 𝐴𝐵 ∧ ¬ 𝐴𝐵 ) )
3 kardsdom ( 𝐴𝐵 ↔ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )
4 3 notbii ( ¬ 𝐴𝐵 ↔ ¬ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )
5 ralnex2 ( ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ↔ ¬ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )
6 4 5 bitr4i ( ¬ 𝐴𝐵 ↔ ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 )
7 6 anbi2i ( ( 𝐴𝐵 ∧ ¬ 𝐴𝐵 ) ↔ ( 𝐴𝐵 ∧ ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ) )
8 2 7 bitri ( 𝐴𝐵 ↔ ( 𝐴𝐵 ∧ ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ) )
9 karddom ( 𝐴𝐵 ↔ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )
10 8 9 bianbi ( 𝐴𝐵 ↔ ( ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 ∧ ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ) )
11 10 biancomi ( 𝐴𝐵 ↔ ( ∀ 𝑥 ∈ ( kard ‘ 𝐴 ) ∀ 𝑦 ∈ ( kard ‘ 𝐵 ) ¬ 𝑥𝑦 ∧ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 ) )
12 bren2 ( 𝑥𝑦 ↔ ( 𝑥𝑦 ∧ ¬ 𝑥𝑦 ) )
13 12 biancomi ( 𝑥𝑦 ↔ ( ¬ 𝑥𝑦𝑥𝑦 ) )
14 13 2rexbii ( ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 ↔ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) ( ¬ 𝑥𝑦𝑥𝑦 ) )
15 1 11 14 3imtr4i ( 𝐴𝐵 → ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )
16 elkarden ( 𝑥 ∈ ( kard ‘ 𝐴 ) → 𝑥𝐴 )
17 elkarden ( 𝑦 ∈ ( kard ‘ 𝐵 ) → 𝑦𝐵 )
18 ensym ( 𝑥𝐴𝐴𝑥 )
19 entr ( ( 𝐴𝑥𝑥𝑦 ) → 𝐴𝑦 )
20 18 19 sylan ( ( 𝑥𝐴𝑥𝑦 ) → 𝐴𝑦 )
21 20 ancoms ( ( 𝑥𝑦𝑥𝐴 ) → 𝐴𝑦 )
22 entr ( ( 𝐴𝑦𝑦𝐵 ) → 𝐴𝐵 )
23 21 22 stoic3 ( ( 𝑥𝑦𝑥𝐴𝑦𝐵 ) → 𝐴𝐵 )
24 23 3expib ( 𝑥𝑦 → ( ( 𝑥𝐴𝑦𝐵 ) → 𝐴𝐵 ) )
25 24 com12 ( ( 𝑥𝐴𝑦𝐵 ) → ( 𝑥𝑦𝐴𝐵 ) )
26 16 17 25 syl2an ( ( 𝑥 ∈ ( kard ‘ 𝐴 ) ∧ 𝑦 ∈ ( kard ‘ 𝐵 ) ) → ( 𝑥𝑦𝐴𝐵 ) )
27 26 rexlimivv ( ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦𝐴𝐵 )
28 15 27 impbii ( 𝐴𝐵 ↔ ∃ 𝑥 ∈ ( kard ‘ 𝐴 ) ∃ 𝑦 ∈ ( kard ‘ 𝐵 ) 𝑥𝑦 )